CN117333180A

CN117333180A - Block chain-based data processing method, device, equipment and readable storage medium

Info

Publication number: CN117333180A
Application number: CN202311341226.3A
Authority: CN
Inventors: 聂凯轩; 梁军; 王宗友; 吴方; 蔡庆普; 朱耿良; 时一防; 刘区城; 廖志勇; 刘汉卿; 黄杨峻
Original assignee: Tencent Technology Shenzhen Co Ltd
Current assignee: Tencent Technology Shenzhen Co Ltd
Priority date: 2023-10-13
Filing date: 2023-10-13
Publication date: 2024-01-02

Abstract

The invention discloses a data processing method, a device, equipment and a readable storage medium based on a blockchain, wherein the method comprises the following steps: the block link point receives the intention transaction which is sent by the intention node and contains the intention information and the incentive information, and broadcasts the intention transaction to the solution node cluster; the method comprises the steps of sending intent solution transactions respectively generated by M solution nodes based on intent transactions to the intent nodes; an intent-to-solve transaction includes intent information, incentive information, solution information, and solution proof information; when the block chain node receives a target intention solving transaction sent by the intention node, performing consensus uplink processing on the target intention solving transaction; the target intent-to-solve transaction is generated by the intent node based on N intent-to-solve transactions included in the M intent-to-solve transactions, and the incentive information is used for indicating to conduct incentive processing on solution nodes associated with the N intent-to-solve transactions. By adopting the method and the system, the flexibility of the blockchain system can be improved, and the types of intents which can be solved by the transaction can be increased.

Description

Block chain-based data processing method, device, equipment and readable storage medium

Technical Field

The present disclosure relates to the field of computer technologies, and in particular, to a data processing method, apparatus, device and readable storage medium based on a blockchain.

Background

An intelligent contract is an automated contract that is capable of automatically executing and enforcing terms, typically running on top of blockchain technology. Smart contracts are written using specific programming languages that must have a smartness so that the smart contract can simulate all the functions of a computer and can execute any possible computer algorithm.

In existing blockchain systems that support intelligent contracts that are complete with a Turing, a transaction needs to include complete intent (the purpose of initiating the transaction) -resolution (how to implement the intent, such as a transfer, or call a specified intelligent contract). That is, the transaction sender sends the transaction with the intended solution known. It will be appreciated that most intent type solutions are typically implemented by smart contracts, which results in the intent types that transactions in blockchain systems can address being consistently limited by the smart contracts that can be invoked, resulting in poor flexibility of the blockchain system.

Disclosure of Invention

The embodiment of the application provides a data processing method, device and equipment based on a blockchain and a readable storage medium, which can improve the flexibility of a blockchain system and increase the intention types which can be solved by transactions.

An aspect of an embodiment of the present application provides a data processing method based on a blockchain, including:

the block link point receives the intention transaction sent by the intention node and broadcasts the intention transaction to the solution node cluster; the intent-to-transact includes intent information and incentive information;

receiving intention solving transactions respectively generated by M solving nodes based on the intention transactions, and sending the M intention solving transactions to the intention nodes; m is a positive integer; m solving nodes belong to a solving node cluster; an intent-to-resolve transaction is generated by a resolution node belonging to a cluster of resolution nodes; an intent-to-solve transaction includes intent information, incentive information, solution information, and solution proof information; the solution information is used for replying to the intention information;

when the block chain node receives a target intention solving transaction sent by the intention node, performing consensus uplink processing on the target intention solving transaction; the target intention solving transaction is generated according to the summary of N intention solving transactions when the intention node determines that solution information contained in N intention solving transactions passes through the intention information based on solution proof information contained in N intention solving transactions; n is a positive integer, and N intent-to-solve transactions belong to M intent-to-solve transactions; the incentive information is used for indicating that the N solution nodes respectively associated with the intention solution transactions are subjected to incentive processing in the consensus uplink processing process.

the intent node transmits an intent transaction including intent information and incentive information to the block link points such that the block link points broadcast the intent transaction to the solution node cluster;

receiving M intent solution transactions sent by a blockchain node; m is a positive integer; the M intention solving transactions are generated by the M solving nodes based on the intention transactions respectively; m solving nodes belong to a solving node cluster; an intent-to-solve transaction includes intent information, incentive information, solution information, and solution proof information; the solution information is used for replying to the intention information;

performing reply verification processing on solution information contained in the M intent-to-solve transactions based on solution proof information contained in the M intent-to-solve transactions, and determining reply verification results;

carrying out transaction summarization processing on N intention solution transactions through which solution information reply intention information indicated by the reply verification result passes to obtain target intention solution transactions, and sending the target intention solution transactions to a blockchain node so that the blockchain node carries out consensus uplink processing on the target intention solution transactions; the incentive information is used for indicating that the N solution nodes respectively associated with the intention solution transactions are subjected to incentive processing in the consensus uplink processing process.

An aspect of an embodiment of the present application provides a data processing apparatus based on a blockchain, including:

the first receiving module is used for receiving the intention transaction sent by the intention node and broadcasting the intention transaction to the solution node cluster; the intent-to-transact includes intent information and incentive information;

the second receiving module is used for receiving the intention solving transactions respectively generated by the M solving nodes based on the intention transactions and sending the M intention solving transactions to the intention nodes; m is a positive integer; m solving nodes belong to a solving node cluster; an intent-to-solve transaction includes intent information, incentive information, solution information, and solution proof information; the solution information is used for replying to the intention information;

the consensus uplink module is used for performing consensus uplink processing on the target intention solution transaction when the block link point receives the target intention solution transaction sent by the intention node; the target intention solving transaction is generated according to the summary of N intention solving transactions when the intention node determines that solution information contained in N intention solving transactions passes through the intention information based on solution proof information contained in N intention solving transactions; n is a positive integer, and N intent-to-solve transactions belong to M intent-to-solve transactions; the incentive information is used for indicating that the N solution nodes respectively associated with the intention solution transactions are subjected to incentive processing in the consensus uplink processing process.

Wherein the M solution nodes comprise first solution nodes;

a second receiving module comprising:

a set adding unit for adding the intention solving transaction to the intention solving transaction set when the blockchain node receives the intention solving transaction generated by the first solving node based on the intention transaction;

and the transaction sending unit is used for determining the intention solving transaction contained in the intention solving transaction set as M intention solving transactions and sending the M intention solving transactions to the intention node when the block chain node determines that the intention waiting time reaches the intention waiting time threshold.

Wherein, the consensus uplink module includes:

the consensus unit is used for sending the target intention solving transaction to the consensus node cluster so that the consensus node cluster carries out consensus processing on the target intention solving transaction to obtain a consensus result;

the excitation unit is used for carrying out excitation processing on the N solution nodes according to the excitation information if the consensus result is a consensus passing result, so as to obtain an excitation result; the N solving nodes are respectively associated solving nodes for solving the transaction with N intents;

and the writing unit is used for writing the incentive result and the target intention solving transaction into the blockchain ledger.

Wherein the excitation unit includes:

the first excitation subunit is used for calling an excitation contract according to the excitation information, determining an excitation total amount through the excitation contract, and carrying out average processing on the excitation total amount according to N to obtain an excitation average amount;

the first incentive sub-unit is further used for respectively distributing incentive resources indicated by the incentive average amount to each solution node respectively associated with each intention to solve the transaction;

the first excitation subunit is further configured to determine excitation resource allocation results corresponding to the N solution nodes as excitation results.

The target intention solving transaction comprises N solution nodes respectively corresponding to excitation weights;

an excitation unit comprising:

the second excitation subunit is used for calling an excitation contract according to the excitation information and acquiring an excitation total through the excitation contract;

the second excitation subunit is further used for traversing and acquiring excitation weights corresponding to the ith solution node, and determining excitation amounts corresponding to the ith solution node according to the excitation total sum and the excitation weights corresponding to the ith solution node; i is a positive integer less than or equal to N;

the second excitation subunit is further configured to allocate excitation resources indicated by the excitation amount corresponding to the ith solution node;

And the second excitation subunit is further configured to determine excitation resource allocation results corresponding to the N solution nodes as excitation results.

The target intention solving transaction comprises node priorities corresponding to N solving nodes respectively;

an excitation unit comprising:

the third excitation subunit is used for calling an excitation contract according to the excitation information, acquiring an excitation total and an excitation distribution rule through the excitation contract, and determining N excitation amounts and excitation priorities corresponding to the N excitation amounts according to the excitation total, N and the excitation distribution rule; the sum of the N incentive amounts is equal to the incentive sum;

the third excitation subunit is further configured to traverse and acquire a transaction priority corresponding to the jth solution node, and determine an excitation amount corresponding to the jth solution node as an excitation amount corresponding to the jth solution node, where the excitation priority matches with the node priority corresponding to the jth solution node; j is a positive integer less than or equal to N;

the third excitation subunit is further configured to allocate excitation resources indicated by an excitation amount corresponding to the jth solution node;

and the third excitation subunit is further configured to determine excitation resource allocation results corresponding to the N solution nodes as excitation results.

Wherein the intent-to-trade also includes an intent-to-sign; the intention signature is obtained by signing the intention information through an owned private key by the intention node;

the above data processing apparatus further includes:

the signature verification module is used for acquiring the public key of the intention node, verifying the intention signature through the public key and obtaining a signature verification result;

the signature verification module is further used for sending transaction error prompt information to the intention node if the signature verification result is a verification failure result;

and the signature verification module is also used for executing the step of broadcasting the intended transaction to the solution node cluster if the signature verification result is a verification success result.

the transaction transmitting module is used for transmitting an intention transaction containing intention information and incentive information to the block link points so that the block link points broadcast the intention transaction to the solution node cluster;

the transaction receiving module is used for receiving M intention solving transactions sent by the blockchain node; m is a positive integer; m intent-to-solve transactions are generated by M solution nodes based on the intent-to-solve transactions, respectively; m solving nodes belong to a solving node cluster; an intent-to-solve transaction includes intent information, incentive information, solution information, and solution proof information; the solution information is used for replying to the intention information;

The reply verification module is used for carrying out reply verification processing on solution information contained in the M intent solution transactions based on the solution proof information contained in the M intent solution transactions and determining reply verification results;

the transaction summarization module is used for carrying out transaction summarization processing on N intention solution transactions through which the solution information reply intention information indicated by the reply verification result passes to obtain target intention solution transactions, and sending the target intention solution transactions to the blockchain node so that the blockchain node carries out consensus uplink processing on the target intention solution transactions; the incentive information is used for indicating that the N solution nodes respectively associated with the intention solution transactions are subjected to incentive processing in the consensus uplink processing process.

Wherein the M intent-to-solve transactions include intent-to-solve transaction M _a A is a positive integer less than or equal to M; intent to resolve transaction M _a Containing proof of resolution information for intent to resolve transaction M _a Solution step information corresponding to the contained solution information;

a reply verification module comprising:

the first verification unit is used for carrying out intention solving processing on the intention information according to the solution step information to obtain intention solving information;

A first verification unit for, if the intention is to solve the information and the intention is to solve the transaction M _a Containing the same solution information, determining that the transaction M is intended to be resolved _a The contained solution information replies to the intended information passing.

Wherein the M intent-to-solve transactions include intent-to-solve transaction M _a A is a positive integer less than or equal to M; intent to resolve transaction M _a The included solution proof information comprises zero knowledge proof data and zero knowledge verification parameters; zero knowledge proof data is for intent to resolve transaction M _a The solution information is generated after zero knowledge proof processing;

a reply verification module comprising:

the second verification unit is used for carrying out zero knowledge proof verification processing on the zero knowledge proof data according to the zero knowledge verification parameters to obtain a zero knowledge proof verification processing result;

the second verification unit is further configured to determine that the transaction M is intended to be resolved if the zero-knowledge proof verification processing result is a zero-knowledge proof verification passing result _a The contained solution information replies to the intended information passing.

Wherein the M intent-to-solve transactions include intent-to-solve transaction M _a A is less than or equal toA positive integer equal to M; intent to resolve transaction M _a The contained solution proof information is private key verification prompt information; intent to resolve transaction M _a The contained solution information is encryption solution information; the encryption solution information is obtained by encrypting the original solution information by an encryption public key;

a reply verification module comprising:

the third verification unit is used for obtaining an encryption private key corresponding to the encryption public key according to the private key verification prompt information, and decrypting the encryption solution information through the encryption private key to obtain original solution information;

the third verification unit is also used for determining a reply result of the original solution information aiming at the intention information;

a third verification unit for determining the intention solving transaction M if the reply result of the original solution information aiming at the intention information is a reply passing result _a The contained solution information replies to the intended information passing.

In one aspect, a computer device is provided, including: a processor, a memory, a network interface;

the processor is connected to the memory and the network interface, where the network interface is used to provide a data communication network element, the memory is used to store a computer program, and the processor is used to call the computer program to execute the method in the embodiment of the present application.

In one aspect, embodiments of the present application provide a computer readable storage medium having a computer program stored therein, the computer program being adapted to be loaded by a processor and to perform a method according to embodiments of the present application.

In one aspect, the embodiments of the present application provide a computer program product or a computer program, where the computer program product or the computer program includes computer instructions, where the computer instructions are stored in a computer readable storage medium, and where a processor of a computer device reads the computer instructions from the computer readable storage medium, and where the processor executes the computer instructions, so that the computer device performs a method in an embodiment of the present application.

In the embodiment of the application, after receiving the intention transaction sent by the intention node, the block chain node broadcasts the intention transaction to the solution node cluster, then receives the intention solution transactions respectively generated by M solution nodes based on the intention transaction, sends the M intention solution transactions to the intention node, and finally carries out consensus uplink processing on the target intention solution transaction when the block chain node receives the target intention solution transaction sent by the intention node. Wherein the intent-to-transact includes intent information and incentive information; m is a positive integer; m solving nodes belong to a solving node cluster; an intent-to-solve transaction includes intent information, incentive information, solution information, and solution proof information; the solution information is used for replying to the intention information; the target intention solving transaction is generated according to the summary of N intention solving transactions when the intention node determines that solution information contained in N intention solving transactions passes through the intention information based on solution proof information contained in N intention solving transactions; n is a positive integer, and N intent-to-solve transactions belong to M intent-to-solve transactions; the incentive information is used for indicating that the N solution nodes respectively associated with the intention solution transactions are subjected to incentive processing in the consensus uplink processing process. By the method provided by the embodiment of the application, when the intention information needs to be solved, the corresponding intention transaction can be generated and sent to the blockchain node in the blockchain system only by giving the corresponding incentive information, then the blockchain node is waited to match proper solution information for the intention information to the solution node cluster, the solution information corresponding to the intention information is not needed to be known any more, the transaction can be initiated, the flexibility of the blockchain system is improved, and the intention type which can be solved through the transaction is increased.

Drawings

In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described below, it being obvious that the drawings in the following description are only some embodiments of the present application, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.

Fig. 1 is a schematic diagram of a network architecture according to an embodiment of the present application;

FIG. 2a is a schematic diagram of a scenario of an intent-to-transact broadcast provided by embodiments of the present application;

FIG. 2b is a schematic diagram of a scenario in which a target intent to resolve transaction uplink is provided in an embodiment of the present application;

FIG. 3 is a flowchart of a data processing method based on a blockchain according to an embodiment of the present disclosure;

FIG. 4 is a flowchart of a data processing method based on a blockchain according to an embodiment of the present disclosure;

FIG. 5 is a schematic diagram of an intent-resolution blockchain architecture provided by embodiments of the present application;

FIG. 6 is a schematic flow chart of an intent to resolve transaction generation and chaining provided by an embodiment of the present application;

FIG. 7 is a schematic diagram of a block chain based data processing apparatus according to an embodiment of the present application;

FIG. 8 is a schematic illustration of a computer device provided in an embodiment of the present application;

FIG. 9 is a schematic diagram of another block chain based data processing apparatus according to an embodiment of the present application;

fig. 10 is a schematic structural diagram of another computer device according to an embodiment of the present application.

Detailed Description

The following description of the embodiments of the present application will be made clearly and fully with reference to the accompanying drawings, in which it is evident that the embodiments described are only some, but not all, of the embodiments of the present application. All other embodiments, which can be made by one of ordinary skill in the art based on the embodiments herein without making any inventive effort, are intended to be within the scope of the present application.

For ease of understanding, the following simple explanation of partial nouns is first made:

1. blockchain (Block chain): in a narrow sense, the blockchain is a chain data structure taking a block as a basic unit, and the block uses a digital abstract to verify the transaction history acquired before, so that the blockchain is suitable for the requirements of tamper resistance and expandability in a distributed accounting scene; in a broad sense, blockchain also refers to distributed accounting techniques implemented by blockchain structures, including distributed consensus, privacy and security protection, point-to-point communication techniques, network protocols, smart contracts, and the like.

The goal of the blockchain is to implement a distributed data logging ledger that allows only additions and not deletions. The basic structure of the ledger floor is a linear linked list. The linked list is formed by serially connecting blocks, the Hash value of the preceding block is recorded in the following blocks, and whether each block (and the transaction in the block) is legal or not can be rapidly checked by calculating the Hash value. If a node in the network proposes to add a new block, a consensus acknowledgement must be made for the block via a consensus mechanism.

2. Block (block): the data packet carrying transaction data on the blockchain network is a data structure marked with a timestamp and a hash value corresponding to a preceding block, and the block verifies and confirms the transaction in the block through a consensus mechanism of the network. The Block includes a Block Header (Block Header) and a Block Body (Block Body), where the Block Header can record meta information of the current Block and includes data such as a current version number, a hash value corresponding to a previous Block, a timestamp, a random number, a hash value of a Merkle Root (Merkle Root), and the like. The block may record detailed data generated over a period of time, including all transaction records or other information generated during the creation of the block for which the current block is verified, and may be understood as a representation of the ledger. In addition, the detailed data of the block may include generating a unique Merkle Root record in the block header through a hash process of a Merkle Tree (Merkle Tree).

The successor Block, also called Parent Block (Parent Block), is a Block chain that performs temporal ordering by recording the hash value corresponding to the Block and the hash value corresponding to the Parent Block in the Block header.

3. Hash value (hash): also called information characteristic value or eigenvalue, hash value is generated by converting input data of arbitrary length into a password by hash algorithm and performing fixed output, and original input data cannot be retrieved by decrypting the hash value, which is a one-way encryption function. In a blockchain, each block (except the initial block) contains a hash value of the successor block, which is the potential core foundation and most important aspect in blockchain technology, which preserves the authenticity of the recorded and viewed data, as well as the integrity of the blockchain as a whole.

4. Smart Contract: an intelligent contract is a computer protocol that aims to propagate, verify, or execute contracts in an informative manner. The concept of intelligent contracts has three major elements of commitment, agreement and digital form, so that the application range of the blockchain can be expanded to all links of transaction, payment, settlement and clearing in the financial industry. Intelligent contracts refer to the immediate execution of corresponding contract terms when a pre-programmed condition is triggered, the working principle of which is similar to the if-then statement of a computer program. Smart contracts allow trusted transactions to be made without third parties, which transactions are traceable and irreversible.

5. Turing complete refers to a computer language or computational model that has sufficient capabilities to simulate all of the functions of a turing machine. A turing machine is a computational model that can simulate any computer algorithm and is considered one of the most basic models in computer science. Turing integrity is applied in smart contracts by writing the smart contract using some specific programming language that must have Turing integrity. In this way, the smart contract can simulate all the functions of a computer and can execute any possible computer algorithm.

6. Zero Knowledge Proof (Zero-knowledgeproof of): zero knowledge proof refers to the ability of a prover to trust that a certain assertion is correct without providing the verifier with any useful information. Zero knowledge proof is essentially a protocol involving two or more parties, i.e., a series of steps that two or more parties need to take to complete a task. The prover proves to the verifier and believes itself to know or own a certain message, but the proving process cannot reveal any information about the proved message to the verifier. Common zero knowledge proof tools, such as: zoKrates, zero knowledge proof circuit.

7. Public key encryption: also called asymmetric (key) encryption (public key encryption), which belongs to the network security secondary discipline under the communication technology, refers to an encryption method consisting of a corresponding pair of unique keys (i.e., a public key and a private key). The method solves the issue and management problems of the secret key and is the core of the business password. In the public key cryptosystem, a private key is not disclosed, and a public key is disclosed. Ciphertext obtained by encrypting plaintext by using one of the keys (which may be a public key) can only be decrypted by using the corresponding other key (the corresponding private key) to obtain the original plaintext, and even the key originally used for encryption cannot be used for decryption, which is the most important property or characteristic of asymmetric encryption.

Referring to fig. 1, fig. 1 is a schematic diagram of a network architecture according to an embodiment of the present application. As shown in fig. 1, the network architecture may include a blockchain node cluster 1000, a solution node cluster 100, and an intent node cluster 10, the blockchain node cluster 1000 may include at least two blockchain nodes, the solution node cluster 100 may include at least two solution nodes, and the intent node cluster may include at least two intent nodes. As shown in fig. 1, the block link point cluster 1000 may include block link points 1000a, block link points 1000b, …, block link nodes 1000n, the solution node cluster 100 may include solution nodes 100a, 100b, …, 100n, and the intent node cluster 10 may include intent nodes 10a, 10b, …, 10n.

As shown in FIG. 1, intent node 10a, intent nodes 10b, …, intent node 10n may make data connections with block link point 1000a, block link points 1000b, …, block chain node 1000n, respectively, so that intent nodes may interact with block chain nodes through the data connections; the solution node 100a, the solution nodes 100b, …, and the solution node 100n may respectively perform data connection with the block link point 1000a, the block link points 1000b, …, and the block chain node 1000n, so that the solution node may perform data interaction with the block chain node through the data connection; the blockchain points 1000a, the blockchain points 1000b, …, and the blockchain node 1000n are interconnected so that data interaction between the blockchain nodes is possible.

It will be appreciated that data or block transfer may be performed between the blockchain nodes via the data connections described above. The blockchain network may implement data connection between blockchain nodes based on node identifiers, and for each blockchain node in the blockchain network, each blockchain node may have a node identifier corresponding to the blockchain node, and each blockchain node may store node identifiers of other blockchain nodes having a connection relationship with the blockchain node, so as to broadcast the acquired data or generated blocks to other blockchain nodes according to the node identifiers of the other blockchain nodes, for example, the blockchain node 1000a may maintain a node identifier list as shown in table 1, where the node identifier list stores node names and node identifiers of the other nodes:

TABLE 1

Node name	Node identification
		Blockchain node 1000a	AAA.AAA.AAA.AAA
Block chain node 1000b	BBB.BBB.BBB.BBB
		…	…
Blockchain node 1000n	CCC.CCC.CCC.CCC

The node identifier may be any protocol (Internet Protocol, IP) address of the interconnection between networks, and any other information that can be used to identify the blockchain node in the blockchain network, and the IP address is only illustrated in table 1. For example, block link point 1000a may send information (e.g., transaction data) to block link point 1000b by node identification bbb.bbb.bbb.bbb, and block link point 1000b may determine that the information was sent by block link point 1000a by node identification aaa.aaa.aaa.

In a blockchain, a block must be consensus-passed through consensus nodes in the blockchain network before the block is uplink, and the block can be added to the blockchain after the consensus passes. It will be appreciated that when a blockchain is used in some contexts of a government or commercial establishment, not all participating nodes in the blockchain (i.e., blockchain nodes in blockchain node cluster 1000 described above) have sufficient resources and necessity to become consensus nodes of the blockchain. For example, in the blockchain node cluster 1000 shown in fig. 1, blocklink points 1000a, blocklink points 1000b, and blocklink points 1000n may be considered common nodes in the blockchain node cluster. The consensus nodes in the block link point cluster 1000 participate in consensus, that is, consensus a block (including a batch of transactions), including generating a block, voting on the block; while non-consensus nodes do not participate in consensus, but will help propagate block and vote messages, and synchronize status with each other, etc.

It should be understood that the above data connection is not limited to a connection manner, and may be directly or indirectly connected through a wired communication manner, may be directly or indirectly connected through a wireless communication manner, and may also be connected through other connection manners, which is not limited herein.

It is understood that the blockchain-based data processing method provided by the embodiments of the present application may be performed by a computer device, including but not limited to the blockchain node (which may be a terminal device or a server), an intention node (which may be a terminal device or a server), and a resolution node (which may be a terminal device or a server). The server may be an independent physical server, a server cluster or a distributed system formed by a plurality of physical servers, or a cloud server providing cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, domain name services, security services, CDNs, basic cloud computing services such as big data and artificial intelligence platforms. The terminal device may be, but is not limited to, a smart phone, a tablet computer, a notebook computer, a desktop computer, a smart speaker, a smart watch, etc.

It is to be appreciated that embodiments of the present application may be applied to a variety of scenarios including, but not limited to, cloud technology, artificial intelligence, intelligent transportation, assisted driving, and the like.

It will be appreciated that in the specific embodiments of the present application, related data such as transaction data is referred to, and when the above embodiments of the present application are applied to specific products or technologies, user permissions or consents are required, and the collection, use and processing of related data is required to comply with relevant laws and regulations and standards of the relevant countries and regions.

As shown in fig. 1, an intent object may send an intent transaction to a block link through an intent node associated therewith, which may contain intent information to indicate the intent of the intent object, i.e., the intent object wants to reach or achieve, and incentive information to indicate operations that need to be performed when the intent object's goal is achieved, typically rewarding a resolution object that helps the intent object to resolve the intent. After receiving the intention transaction sent by the intention node, the blockchain node can broadcast the intention transaction to the solution node cluster, namely, notify intention information of an intention object to a solution object associated with the solution node cluster. If a solution object can solve the intention of an intention object, the solution object can perform an intention reply operation through a solution node associated with the solution object, the associated solution node can respond to the intention reply operation, and an intention solution transaction is generated on the basis of the intention transaction, namely corresponding solution information and solution proving information are added in the intention transaction, so that the intention solution transaction is obtained, and then the solution node can send the intention solution transaction to a blockchain node. It is understood that any one of the solution nodes in the solution node cluster may generate an intent-to-solve transaction based on the intent-to-trade in response to the intent-to-answer operation of the associated solution object, and therefore, the blockchain node may receive the intent-to-solve transactions generated by the M solution nodes based on the intent-to-trade, respectively, with M being a positive integer. Then, the blockchain node may return the M intent-to-solve transactions to the intent node, the intent object may select, from the M intent-to-solve transactions, N intent-to-solve transactions through which the intent information of the intent object is replied, and then, the intent node may perform transaction summary processing on the N intent-to-solve transactions in response to the selection operation of the intent object, to obtain a final target intent-to-solve transaction, and then send the target intent-to-solve transaction to the blockchain node, where the blockchain node may perform final consensus uplink processing on the target intent-to-solve transaction. It will be appreciated that in the course of the consensus uplink process of the target intent-to-resolve transaction, the blockchain node may perform an incentive process on the solution nodes respectively associated with the N intent-to-resolve transactions according to the incentive information.

To facilitate understanding of the above process, please refer to fig. 2 a-2 b, wherein the intent node 20 shown in fig. 2 a-2 b may be any intent node in the intent node cluster shown in fig. 1, and the intent node 20 may be the intent node 10a; the blockchain node 21 shown in fig. 2 a-2 b may be any blockchain node in the blockchain node cluster shown in fig. 1, as described above, such as blockchain node 21 may be blockchain node 1000a; the solving node cluster 22 as shown in fig. 2 a-2 b may be the solving node cluster 100 as shown in fig. 1 above.

Referring to fig. 2a, fig. 2a is a schematic view of an application scenario for intent publishing according to an embodiment of the present application. As shown in fig. 2a, when the intention object wants to achieve the intention 1 (which may be any desired purpose), it is possible to apply for joining the blockchain network by having a terminal device that the intention object's terminal device will become an intention node in the blockchain network. For example, the intention object is a traveler who wants to consult a travel-related question, who can apply for joining a blockchain network through his/her own terminal device, at which point his/her own terminal device can be the intention node 20 as shown in fig. 2a, through his/her associated intention node 20, if he/she wants to know about a favorite restaurant, the intention node 20 can perform an intention transaction generating operation in response to the intention object's intention transaction generating operation, generating an intention transaction 23 containing intention 1[ recommend a favorite restaurant ] and incentive 1, where incentive 1 is an incentive operation performed by the intention object promised to arrive at intention 1, which incentive 1 can be performed when the blockchain node confirms that intention 1 is implemented, typically for indicating to rewards the solution object for helping the intention object to resolve, for example, incentive 1 can be a transfer operation to the solver of 2 digital resources that can circulate on the blockchain, i.e., for indicating to transfer 2 digital resources to the solver. After generating the intent-to-trade 23, the intent-to-node 20 sends the intent-to-trade 23 to the blockchain network, e.g., to the blockchain node 21. Blockchain node 21, upon receiving an intended transaction 23 containing only intended 1 and incentive 1, may broadcast it to resolution node cluster 22 after verifying that it is legitimate. Each solution node in the solution node cluster 22 may be a terminal device that a different solution object has, that is, when the solution object wants to obtain the reward provided by the intention object by replying to the intention, the solution object may apply for joining the blockchain network through its own terminal device, at this time, the solution object's terminal device will become one solution node in the blockchain network, all solution nodes in the blockchain network constitute the solution node cluster 22, for example, the solution object may be a travel agency, which knows many travel-related information, and the travel agency may apply for joining the blockchain network through its own terminal device, at this time, the travel agency's terminal device may act as a solution node in the blockchain network to reply to the intention of the travel-related problem.

It will be appreciated that the solution object associated with the solution node cluster 22 is aware of the intent 1 of the intent object through the intent transaction 23, if the solution object is able to resolve the intent 1, the solution object may perform an intent reply operation through the associated solution node, the solution node may obtain solution information for resolving the intent 1 and solution proof information for proving that the solution information is correct in response to the intent reply operation, and then add the solution information and the solution proof information to the intent transaction 23, thereby obtaining an intent solution transaction.

For better understanding, please refer to fig. 2b together, fig. 2b is a schematic diagram of an application scenario intended to be resolved according to an embodiment of the present application. As shown in fig. 2B, assuming that both travel agency a associated with resolution node 22a and travel agency B associated with resolution node 22n are aware of a good-first restaurant, resolution node 22a may generate an intent-to-resolve transaction 24 in response to its associated intent-to-reply operation by travel agency a, which intent-to-resolve transaction 24 may include intent 1, incentive 1, resolution 1, and proof 1, where resolution 1 refers to solution information for replying to intent 1, proof 1 is then a proof of correctness for resolution 1, e.g., resolution 1 is snack hall B, proof 1 may be scoring data of local residents on the local restaurant; solution node 22n may also generate an intent-to-solve transaction 25 in response to its associated travel agency's B intent-to-reply operation, which intent-to-solve transaction 25 would include intent 1, incentive 1, solution 2, and proof 2, where solution 2 refers to solution information for replying to intent 1, it being understood that solution 1 and solution 2 may be different solution information, proof 2 being a proof of correctness of solution 2, e.g., solution 2 being home menu C, proof 2 may be a professional specification of the cook of home menu C.

As shown in FIG. 2b, the resolution node 22a sends the intent-to-resolve transaction 24 to the blockchain node 21, and the resolution node 22n sends the intent-to-resolve transaction 25 to the blockchain node 21, i.e., the blockchain node 21 receives 2 intent-to-resolve transactions for the intent-to-resolve transaction 23 at this time, at which point the blockchain node 21 may return both the intent-to-resolve transaction 24 and the intent-to-resolve transaction 25 to the intent node 20 for the intent-to-be-resolved object to select a satisfactory solution. Assuming that the intention object, after verifying both proof 1 and proof 2, considers that both proof 1 and proof 2 can help oneself to resolve intention 1, namely, recognizing that the local resident's score data of the local restaurant and the professional description of the chef of hometown cuisine c are both good first restaurants, the intention object can select and confirm the intention resolving transaction 24 together with the intention resolving transaction 25, at this time, the intention node can respond to the selection confirming operation of the intention object, the intention resolving transaction 24 and the intention resolving transaction 25 are processed together to obtain the intention resolving transaction 26, the intention resolving transaction 26 can include the intention 1[ recommended first restaurant ], incentive 1 (for indicating that 2 digital resources are transferred to the resolver), the solving 1|and the proving 1|2 [ snack cuisine c ], the local resident 1|2 [ score data of the local restaurant|for the kitchen cuisine c ] and the professional description of the intention cuisine c ], then the intention node can send the intention resolving transaction 26 to the intention resolving block 21 together, and then the intention resolving transaction 26 to the intention resolving block 21, namely, the intention resolving agent 22 can be associated with the intention resolving block 22 by means of the intention resolving agent 1, namely, the intention resolving block 22 is carried out according to the average digital resources of the intention resolving node 1 (namely, the current resolving agent 1 is indicated by the current node B is well at the node B).

Therefore, in the application, when the intention object initiates the transaction to the blockchain system, even if the solution corresponding to the intention is not known, the intention transaction comprising the intention information and the incentive information can be still sent to the blockchain node through the intention node, then the blockchain node waits for the solution node to match the appropriate solution information for the intention information, the transaction can be initiated without knowing the solution information corresponding to the intention information in advance, the flexibility of the blockchain system is improved, and the intention type which can be solved by the transaction can be increased.

Further, referring to fig. 3, fig. 3 is a flow chart of a data processing method based on a blockchain according to an embodiment of the present application. The method may be performed by a blockchain node (e.g., any of the blockchain nodes in the blockchain node cluster 1000 in the embodiment described above with respect to fig. 1). The following will describe the method performed by the blockchain link point as an example, wherein the blockchain-based data processing method may at least include the following steps S101-S103:

step S101, block link points receive intention transactions sent by intention nodes and broadcast the intention transactions to a solution node cluster; the intent-to-trade includes intent information and incentive information.

In particular, the intent information is used to describe the purpose or problem that the intent object intends to achieve, while the incentive information is used to indicate the incentive operation that needs to be performed by the block link point after the intent information of the intent object is resolved, which can be triggering a smart contract or transferring a digital resource. Where digital resources refer to new intangible assets that are released, registered, stored, held, transferred, or transacted based on blockchain technology, which are present in a particular system in digitized form as digitized identifications of value or rights. It will be appreciated that the motivational information corresponding to the intent information is generally a solution object for rewarding help intent object to solve the intent information, thereby attracting more solution objects to help the intent object solve the intent information, increasing the probability that the intent information is solved.

Specifically, the intention node may be a terminal device or a server, the intention node may belong to an intention node cluster, and the solution node in the solution node cluster may also be a terminal device or a server. Alternatively, the intention node cluster and the solution node cluster may be the same node cluster, for example, node cluster a, where if node A1 in node cluster a is the intention node initiating the intention transaction, then nodes other than node A1 in node cluster a may form the solution node cluster corresponding to node A1.

Optionally, the intent-to-trade also contains an intent signature, which is derived by the intent node signing the intent information with the owned private key. After receiving the intention transaction, the blockchain node needs to acquire the public key of the intention node, and verifies the intention signature through the public key to obtain a signature verification result; if the signature verification result is a verification failure result, sending transaction error prompt information to the intention node; and if the signature verification result is a verification success result, executing the step of broadcasting the intended transaction to the solution node cluster.

Step S102, receiving intention solving transactions respectively generated by M solving nodes based on the intention transactions, and sending the M intention solving transactions to the intention nodes; m is a positive integer.

Specifically, an intent-to-resolve transaction is generated by one resolution node belonging to a resolution node cluster, i.e., M resolution nodes all belong to the resolution node cluster; an intent-to-solve transaction includes intent information, incentive information, solution information, and solution proof information. The solution information is used for replying to the intention information, the solution proof information may be proof information for proving that the solution information is correct, for example, the intention information may be solving an equation, the solution information may be a root corresponding to the equation, at this time, the solution proof information may be a process of solving the equation, and the intention object may verify whether the root given by the solution information is correct through the process of solving the equation. It will be appreciated that the solution objects associated with different solution nodes may give different solutions and different proof manners for the same intention information, and thus, the solution information and the corresponding solution proof information acquired by the different solution nodes after responding to the intention reply operation of the solution objects may be different.

Specifically, different solution nodes may generate different intent-to-solve transactions, and the blockchain node may receive the intent-to-solve transactions generated by any solution node based on the intent-to-solve transactions, however, to save resources and time, the blockchain node may limit the duration of waiting to receive the intent-to-solve transactions according to the intent-to-solve duration threshold, at this time, the blockchain node receives M intent-to-solve transactions generated based on the intent-to-solve transactions, and one possible implementation procedure of transmitting the M intent-to-solve transactions to the intent node may be: adding the intent-to-solve transaction to the intent-to-solve transaction set when the blockchain node receives an intent-to-solve transaction generated by the first solution node based on the intent-to-solve transaction; when the blockchain node determines that the intention-to-wait time length reaches the intention-to-wait time length threshold, determining the intention-to-solve transactions contained in the intention-to-solve transaction set as M intention-to-solve transactions, and sending the M intention-to-solve transactions to the intention node. The first solution node belongs to M solution nodes, which may be any node of the M solution nodes. The intention waiting solution time length refers to the accumulated time length after the blockchain node starts broadcasting the intention transaction. The threshold value of the intention-to-wait solution duration may be one hour, ten minutes, etc., and may be a preset fixed value, or may be a threshold value for which the block link points match based on the complexity of intention information included in the intention transaction, which is not limited herein.

Step S103, when the blockchain node receives a target intention solving transaction sent by the intention node, performing consensus uplink processing on the target intention solving transaction; the target intention solving transaction is generated according to the N intention solving transaction summary when the intention node determines that solution information contained in N intention solving transactions passes through the intention information based on solution proof information contained in the N intention solving transactions; and the incentive information is used for indicating to carry out incentive processing on the solution nodes respectively associated with the N intention solution transactions in the consensus uplink processing process.

Specifically, N is a positive integer, and N intent-to-solve transactions belong to M intent-to-solve transactions.

Specifically, one possible implementation of the consensus uplink process for the target intent-to-solve transaction may be: transmitting the target intention solving transaction to a consensus node cluster so that the consensus node cluster carries out consensus processing on the target intention solving transaction to obtain a consensus result; if the consensus result is a consensus passing result, performing excitation processing on the N solution nodes according to the excitation information to obtain an excitation result; the N solving nodes are respectively associated solving nodes for solving the transaction with N intents; the incentive result and the target intent solution transaction are written into a blockchain ledger.

The method comprises the steps of sending the target intention solving transaction to a consensus node cluster so that the consensus node cluster carries out consensus processing on the target intention solving transaction to obtain a feasible implementation process of a consensus result, wherein the feasible implementation process can be as follows: the target intent solution transaction is packaged into a blockchain block, then the blockchain block is broadcast to a consensus node cluster, and then the consensus node cluster can perform consensus processing on the blockchain block based on a consensus mechanism used in the current blockchain network to obtain a consensus result of the blockchain block, wherein the consensus result of the blockchain block is the consensus result of the target intent solution transaction. The consensus mechanism is one of key mechanisms for ensuring transaction safety and reliability in the blockchain technology, realizes the consensus of data and transaction through an algorithm and a protocol between network nodes, ensures that all nodes in the blockchain network agree on the data and the transaction on the blockchain, thereby preventing malicious actions such as data tampering, and the like.

The essence of the incentive information can be triggering intelligent contracts or transferring digital resources, when the incentive information is transferring digital resources, the incentive processing is carried out on the N solution nodes according to the incentive information, and the obtained incentive result is actually the incentive total resources (digital resources corresponding to the incentive total amount) promised by the intention object, and the incentive total resources are distributed to the N solution nodes on average or in proportion. In this application, when allocating the incentive resource to the solution node, the incentive resource may be transferred to the blockchain account address corresponding to the solution object associated with the solution node, or the incentive resource may be directly transferred to the on-chain address corresponding to the solution node, which is not described in detail later.

Specifically, the intention object may set in the excitation information to uniformly divide the excitation total resource to each solution node, and at this time, excitation processing is performed on N solution nodes according to the excitation information, so as to obtain a feasible implementation process of the excitation result, which may be: invoking an incentive contract according to the incentive information, determining an incentive total through the incentive contract, and carrying out average processing on the incentive total according to N to obtain an incentive average amount; allocating incentive resources indicated by the incentive average amount to each solution node respectively associated with each intent-to-solve transaction; and determining excitation resource allocation results corresponding to the N solution nodes as excitation results. The average treatment is carried out on the excitation total according to N, so that a feasible implementation process of the excitation average amount is obtained, namely the excitation total is divided by N, and the obtained value is the excitation average amount.

Specifically, the target intention solving transaction comprises N excitation weights respectively corresponding to the solution nodes; the excitation processing is performed on the N solution nodes according to the excitation information, and a feasible implementation process for obtaining the excitation result may be: invoking an incentive contract according to the incentive information, and acquiring an incentive total through the incentive contract; traversing to obtain the excitation weight corresponding to the ith solution node, and determining the excitation amount corresponding to the ith solution node according to the excitation total sum and the excitation weight corresponding to the ith solution node; i is a positive integer less than or equal to N; allocating excitation resources indicated by the excitation amount corresponding to the ith solution node; and determining excitation resource allocation results corresponding to the N solution nodes as excitation results. The incentive weight may be determined by the intention node according to solution scores corresponding to solution information included in the N intention solution transactions, where the solution scores may be given by the intention object after looking up each solution information, or may be obtained by the intention node performing an intention solution prediction process on each solution information. For example, if the solution resolution score corresponding to the solution information included in the intention to solve the transaction 1 is 90 and the solution resolution score corresponding to the solution information included in the intention to solve the transaction 2 is 60, the excitation weight corresponding to the solution node 1 corresponding to the intention to solve the transaction 1 may be 90/(90+60) =0.6, and the excitation weight corresponding to the solution node 2 corresponding to the intention to solve the transaction 2 may be 60/(90+60) =0.4.

Specifically, the target intention solving transaction includes node priorities corresponding to the N solving nodes respectively; the excitation processing is performed on the N solution nodes according to the excitation information, and a feasible implementation process for obtaining the excitation result may be: invoking an incentive contract according to the incentive information, acquiring an incentive total and an incentive distribution rule through the incentive contract, and determining N incentive amounts and incentive priorities corresponding to the N incentive amounts according to the incentive total, N and the incentive distribution rule; the sum of the N incentive amounts is equal to the incentive sum; traversing to obtain the transaction priority corresponding to the jth solution node, and determining the excitation amount of which the excitation priority is matched with the node priority corresponding to the jth solution node as the excitation amount corresponding to the jth solution node; j is a positive integer less than or equal to N; allocating excitation resources indicated by the excitation amount corresponding to the j-th solution node; and determining excitation resource allocation results corresponding to the N solution nodes as excitation results. The node priority may be determined by the intention node according to a solution score corresponding to solution information included in the N intention solution transactions, that is, the higher the solution score is, the higher the node priority corresponding to the solution score is. The excitation allocation rule may be a predetermined rule, which may specify excitation amounts corresponding to different excitation priorities. For example, the node priority of the solution node 1 is a level, the node priority of the solution node 2 is b level, and according to the excitation allocation rule, the excitation total 100 can be allocated into an excitation amount 80 with excitation priority of a level and an excitation amount 20 with excitation priority of b level, at this time, according to the principle that the node priority and the excitation priority are matched, the excitation amount corresponding to the solution node 1 is 80, and the excitation amount corresponding to the solution node 2 is 20.

By the method provided by the embodiment of the application, when the intention information needs to be solved, the corresponding intention transaction can be generated and sent to the blockchain node in the blockchain system only by giving the corresponding incentive information, then the blockchain node is waited to match proper solution information for the intention information to the solution node cluster, the solution information corresponding to the intention information is not needed to be known any more, the transaction can be initiated, the flexibility of the blockchain system is improved, and the intention type which can be solved through the transaction is increased.

Further, referring to fig. 4, fig. 4 is a flowchart of a data processing method based on a blockchain according to an embodiment of the present application. Wherein the method may be performed by an intended node (e.g., any blockchain node in the intended node cluster 10 in the embodiment corresponding to fig. 1 described above). The method is described below as an example performed by the intended node, wherein the blockchain-based data processing method may at least include the following steps S201-S204:

step S201, the intention node transmits an intention transaction including intention information and incentive information to a block link point, so that the block link point broadcasts the intention transaction to a solution node cluster.

Specifically, the implementation of step S201 may refer to the specific description of step S101 in the embodiment corresponding to fig. 3, which is not described herein.

Step S202, M intention solving transactions sent by the blockchain node are received; m is a positive integer; m intent-to-solve transactions are generated by M solution nodes based on the intent-to-solve transactions, respectively; the M solution nodes belong to the solution node cluster; an intent-to-solve transaction comprising the intent information, the incentive information, solution information, and solution proof information; the solution information is used to reply to the intention information.

Specifically, the implementation of step S202 may refer to the specific description of step S102 in the embodiment corresponding to fig. 3, which is not described herein.

Step S203, performing reply verification processing on the solution information contained in the M intent-to-solve transactions based on the solution proof information contained in the M intent-to-solve transactions, and determining a reply verification result.

In particular, the solution proof information included in an intended solution transaction is typically proof information for embodying the implementation procedure or correctness of the solution information, for example, the solution proof information may be step information for obtaining the solution information, and the solution proof information may also be zero knowledge proof information generated based on the solution information. In addition, when the solution object does not want others to know the solution information, the solution object may encrypt the solution information, and at this time, the solution proof information may be hint information of how to decrypt the encrypted solution information.

Specifically, assume that M intent-to-resolve transactions includes intent-to-resolve transaction M _a A is a positive integer less than or equal to M, intended to resolve transaction M _a Containing proof of resolution information for intent to resolve transaction M _a Solution step information corresponding to the solution information is included, at this time, reply verification processing is performed on solution information included in the M intent-to-solve transactions based on solution proof information included in the M intent-to-solve transactions, and one possible implementation process of the reply verification result is determined, which may be: carrying out intention solving processing on the intention information according to the solution step information to obtain intention solving information; if intention-to-solve information and intention-to-solve transaction M _a Containing the same solution information, determining that the transaction M is intended to be resolved _a The contained solution information replies to the intended information passing.

Specifically, assume that M intent-to-resolve transactions includes intent-to-resolve transaction M _a A is a positive integer less than or equal to M, intended to resolve transaction M _a The included solution proof information includes zero knowledge proof data and zero knowledge verification parameters, the zero knowledge proof data is used for solving the transaction M _a The solution information is generated after zero knowledge proof processing; at this time, reply verification processing is performed on solution information contained in the M intent-to-solve transactions based on solution proof information contained in the M intent-to-solve transactions, and one possible implementation procedure for determining a reply verification result may be: zero knowledge proof verification processing is carried out on the zero knowledge proof data according to the zero knowledge verification parameters, and a zero knowledge proof verification processing result is obtained; if the zero knowledge proof verification processing result is the zero knowledge proof verification passing result, determining that the transaction M is intended to be solved _a The contained solution information replies to the intended information passing. Where zero knowledge proof refers to the proof by the verifier and letting him/herself know or own a certain message, but the proof process does not reveal any information about the proved message to the verifier, i.e. the resolution node can go through zero knowledge proof data to the intention nodeThe point proving itself successfully solves the intention information to obtain the solution information, but does not reveal the relevant information in the solution process of the intention information, and the verifier can perform zero knowledge proof verification processing on the zero knowledge proof data based on the zero knowledge verification parameters, so as to determine the correctness of the solution information. For example, the resolution node may generate the intent resolution transaction M through a zero knowledge proof circuit _a And the intention node can carry out zero knowledge proof verification processing on the zero knowledge proof data through the proof contract and the zero knowledge verification parameters. Wherein, the proof contract is determined based on the zero knowledge proof circuit generating the zero knowledge proof data, a ZoKrates (a tool class project) tool can be adopted to derive the proof contract corresponding to the zero knowledge proof circuit, and a developer can also compile the zero knowledge proof circuit through the ZoKrates tool.

Specifically, assume that M intent-to-resolve transactions includes intent-to-resolve transaction M _a A is a positive integer less than or equal to M; intent to resolve transaction M _a The contained solution proof information is private key verification prompt information; intent to resolve transaction M _a The contained solution information is encryption solution information; the encryption solution information is obtained by encrypting the original solution information by an encryption public key; at this time, reply verification processing is performed on solution information contained in the M intent-to-solve transactions based on solution proof information contained in the M intent-to-solve transactions, and one possible implementation procedure for determining a reply verification result may be: acquiring an encryption private key corresponding to the encryption public key according to the private key verification prompt information, and decrypting the encryption solution information through the encryption private key to obtain original solution information; determining a reply result of the original solution information aiming at the intention information; if the reply result of the original solution information aiming at the intention information is a reply passing result, determining that the intention is to solve the transaction M _a The contained solution information replies to the intended information passing. It will be appreciated that the encryption public key used by the resolution node in encrypting the original solution information may be, in general, an intended node pair The node public key can ensure that only the node private key private to the intended node can decrypt the encrypted solution information, and can prevent other nodes from maliciously acquiring the original solution information.

Step S204, carrying out transaction summarization processing on N intention solving transactions through which the solution information indicated by the reply verification result replies to the intention information to obtain target intention solving transactions, and sending the target intention solving transactions to the blockchain node so that the blockchain node carries out consensus uplink processing on the target intention solving transactions; and the incentive information is used for indicating to carry out incentive processing on the solution nodes respectively associated with the N intention solution transactions in the consensus uplink processing process.

Specifically, after determining that the reply passes through the N intent-to-solve transactions, the intent node may aggregate the N solution information and the N solution proof information included in the N intent-to-solve transactions to obtain the target intent-to-solve transaction, that is, the target intent-to-solve transaction may include the intent information, the incentive information, the N solution information, and the N solution proof information.

Optionally, the transaction summarizing processing of the N intent-to-solve transactions may be implemented by a block link point, that is, after the intent node confirms the N intent-to-solve transactions through which the reply passes, the intent node may send a transaction confirmation notification for the N intent-to-solve transactions to the block link point, and the block link node may perform the transaction summarizing processing of the N intent-to-solve transactions according to the transaction confirmation notification, to obtain the target intent-to-solve transaction.

According to the method provided by the embodiment of the application, when the solution information corresponding to the intention information is not known, other solution objects can be waited for to provide proper solution information for the solution objects in a mode of sending the intention transaction containing the incentive information to the block chain link, so that the flexibility of the block chain system is improved, and the intention type which can be solved by the transaction is increased. In addition, when knowing how to solve but acquiring the solution information is complex or time-consuming, the intention node can still send the intention transaction to the block link to request other solution objects to provide the solution information for the solution node, and the intention node only needs to confirm the correctness and reliability of the solution information by verifying the solution proof information, so that the time or resources of the intention node are saved.

Further, the blockchain system that employs the above-described data processing method to construct a blockchain may be referred to as an intent-to-solve blockchain system, where each blockchain node in the intent-to-solve blockchain system may store one intent-to-solve blockchain, where transactions contained in blocks in the intent-to-solve blockchain are all intent-to-solve transactions. For ease of understanding, please refer to fig. 5, fig. 5 is a schematic diagram of an intent-resolution blockchain provided in an embodiment of the present application. As shown in FIG. 5, the intent-resolution blockchain may include n blocks, namely block 0, block 1, … …, block n. Taking block 2 as an example, the block 2 may include a block header and a block, where the block header may include header information of the block, including a Hash value (pre Hash) of a previous block, a Hash value (Hash) of a block of the block, a TimeStamp (TimeStamp), and the like, and the block may include m transactions, such as transactions 1, …, and transaction m. As can be seen from FIG. 5, in the intent-to-solve blockchain, the structure of the transactions in the blockis shown as transaction m, including intent, rewards, resolution, proof.

The intention, i.e. the intention information described in the embodiment corresponding to fig. 3, refers to the problem that the intention user needs to solve, and may be any problem, including transfer, consultation, help, calculation, etc., for example, the intention user needs to calculate a large number, but the intention user may take calculating the large number as the intention if the computer device of the intention user has no large calculation capability.

The solution, that is, the solution information described in the embodiment corresponding to fig. 3, is a solution for the intention given by the user, for example, when the intention is that a large number needs to be calculated, the solution user has a computer device with super-strong computing power, and the solution user can use his own computer device to complete the calculation to obtain a final number, which is taken as the solution for the intention.

The proof of solution, that is, the proof of solution information described in the embodiment corresponding to fig. 3, is used to prove the correctness or reliability of the solution, which may be an implementation step of the solution for the solution user, or may be a zero knowledge proof of the solution for the solution user, or may assist in decrypting the solution when the solution user conceals the solution through an encryption algorithm.

The incentive information in the embodiment corresponding to fig. 3 is essentially the operation after the realization, that is, the operation that needs to be executed after the transaction is realized through consensus, and may be triggering intelligent contracts or transferring digital resources, and the purpose of executing general incentive is to reward the solving user.

Based on the intent-to-solve blockchain system and the intent-to-solve transaction, the intent transaction is sent to the blockchain link to request matching of appropriate solution information for own intent information when the intent object does not know the solution information or does not want to acquire the solution information by itself, thereby pushing the operation of the blockchain system. For ease of understanding, fig. 6 is a schematic flow diagram of the generation and chaining of transactions with intent to be resolved according to an embodiment of the present application. As shown in fig. 6, the overall main flow of intent-to-solve transaction generation and chaining may include the following steps S11-S23:

In step S11, the intention object terminal 60 transmits the intention transaction Xa to the blockchain node 61.

Specifically, assuming that the intention object a is the intention initiator and its associated intention node is the intention object terminal 60, the intention object a may send an intention transaction Xa, which may include an intention, a reward, and an intention signature, to the blockchain node 61 through the intention object terminal 60. Wherein, the intention signature may be obtained by signing the intention content by the intention object terminal 60 through the private key of the intention object a. Among these, the intention is a problem that the intention object a wants to solve, such as asking questions, computing, asking help, and the like.

In step S12, the blockchain node 61 performs verification processing on the intended transaction Xa after receiving the intended transaction Xa.

Specifically, the verification process may include verifying the validity of the intent-to-trade Xa and performing a disapproval process on the intent-to-sign by the public key of the intent-to-object a, and when the intent-to-trade Xa is confirmed to be valid and the intent-to-sign is disapproved, the intent-to-trade Xa is considered to be verified.

In step S13, if the intended transaction Xa is verified, the intended transaction Xa is broadcast.

Specifically, the blockchain node 61 may broadcast the intent-to-transaction Xa to other blockchain nodes in the blockchain network and to the solution node cluster with the resolution authority, e.g., the blockchain node 61 may send the intent-to-transaction Xa to the solution object terminal 64.

In step S14, the solution target terminal 64 determines a solution according to the intention.

Specifically, after knowing the intention of the intention object a, the solution object B associated with the solution user terminal 64 may perform a corresponding solution operation if there is a capability, and the solution object terminal 64 may respond to the solution operation to obtain a solution/solution corresponding to the intention.

In step S15, the solution object terminal 64 generates a solution proof from the solution.

Specifically, the scheme proof may be a direct public solving step, or may be a proof obtained by hiding the private content by adopting a zero knowledge proof or an encryption algorithm. Wherein, the zero knowledge proof means that a proof is generated according to a zero knowledge proof algorithm and corresponding verification parameters are given. The encryption algorithm, such as an asymmetric encryption algorithm, encrypts the content to be hidden by using the public key of the intention object a, and only the intention object a can decrypt the encrypted content by using the private key, so that other people cannot obtain a solution, and the security can be ensured.

In step S16, the solution target terminal 64 generates a solution transaction Xb from the intended transaction, the solution proof, and signs it using the private key of the solution target B, resulting in a solution signature.

In particular, it will be appreciated that the solution transaction Xb contains, in addition to the intent, rewards, and intent signatures, solutions, solution certificates, and solution signatures.

In step S17, the solution target terminal 64 transmits the solution transaction Xb to the blockchain network, for example, to the blockchain node 61.

In step S18, after receiving the solution transaction Xb, the blockchain node 61 performs verification processing on the solution transaction Xb.

Specifically, the verification process may include verifying the validity of the solution transaction Xb and performing a signing-off process on the solution signature by the public key of the solution object B, and when the solution transaction Xb is confirmed to be legal and the solution signature is signed off, the intention transaction Xb is considered to pass the verification.

In step S19, the blockchain node 61 transmits the solution transaction Xb to the intention object terminal 60 after determining that the solution transaction Xb passes the verification.

In step S20, the intention object terminal 60 verifies the scheme proof.

Specifically, the verification manner of the solution proof depends on the encryption manner of the solution proof, and the specific verification process may refer to the specific description of verifying the solution information based on the solution proof information in step S203 in the embodiment corresponding to fig. 4, which is not described herein.

In step S21, after verifying the solution proof, the intention object terminal 60 determines whether the solution meets the intention of itself, and if it is determined that the solution meets the intention of itself, the confirmed solution transaction Xb is transmitted to the blockchain node 61.

In step S22, after receiving the confirmed solution transaction Xb, the blockchain node 61 may package the confirmed solution transaction Xb into a blockchain block, then broadcast the blockchain block to other blockchain nodes, such as the blockchain node 62 and the blockchain node 63, and then the blockchain node 61, the blockchain node 62, the blockchain node 63, and the like, together identify the blockchain block (including the confirmed solution transaction Xb).

In step S23, after the blockchain node 61 determines that the common knowledge of the blockchain blocks is passed, the rewarding operation included in the confirmed solution transaction Xb is performed.

Specifically, a bonus operation is performed, that is, a bonus resource committed in advance by the intention object a is sent to the solution object B.

Optionally, when a plurality of solution objects generate a plurality of solution transactions in response to the same intention transaction, the blockchain network returns all the solution transactions to the intention object, at this time, the intention object may select an optimal solution transaction from the plurality of solution transactions, the optimal solution transaction is to be executed by the blockchain network, and the solution object proposing the optimal solution transaction may obtain the rewards of the intention object.

Optionally, when a plurality of solution objects respond to the same intention transaction to generate a plurality of solution transactions, the blockchain network returns all solution transactions to the intention object, at this time, the intention user may select a solution transaction that is partially or fully satisfied, the solutions in the solution transactions are summarized to obtain a summarized solution transaction (i.e. the target intention solution transaction described in fig. 3 above), the summarized solution transaction is sent to the blockchain network to perform consensus uplink, at this time, rewards of the intention object may be distributed to the solution object (average score or proportional score), and a specific implementation process may be referred to the specific description of step S103 in the embodiment corresponding to fig. 3 above, which is not repeated here.

Through the method provided by the embodiment of the application, the intention (the problem to be solved) of the intention object is not limited to being realized through the intelligent contracts which are deployed in the blockchain, when the intention object has the actual problem to be solved, an intention transaction can be sent to the blockchain network to indicate the intention of the user and the rewarding/operation which is helpful for solving the intention and is given (triggering a certain intelligent contract or transfer), then the blockchain network can broadcast the intention transaction to the solution object, so that the intention solving mode of the intention object is more flexible and various, when the solution object can give the intention solution, the solution and the proof of the solution can be added to the intention transaction and signed to obtain the solution transaction, then the solution transaction is returned to the intention object through the blockchain network, and after the intention object confirms the intention of the solution, the blockchain network can carry out consensus uplink on the solution transaction and execute the rewarding operation in the solution transaction and send the rewarding operation to the solution object. Based on the intent-to-solve blockchain system of embodiments of the present application, the intent object may solve more practical problems, thereby pushing the entire intent-to-solve blockchain system to operate.

Referring to fig. 7, fig. 7 is a schematic structural diagram of a data processing apparatus based on a blockchain according to an embodiment of the present application. The data processing apparatus may be a computer program (including program code) running on a computer device, for example the data processing apparatus is an application software; the data processing apparatus 1 may be adapted to perform the respective steps of the data processing method provided in the embodiments of the present application. As shown in fig. 7, the data processing apparatus 1 may include: a first receiving module 101, a second receiving module 102 and a consensus uplink module 103.

A first receiving module 101, configured to receive an intent transaction sent by an intent node, and broadcast the intent transaction to a solution node cluster; the intent-to-transact includes intent information and incentive information;

a second receiving module 102, configured to receive intent-to-solve transactions generated by the M solution nodes based on the intent-to-solve transactions, and send the M intent-to-solve transactions to the intent nodes; m is a positive integer; m solving nodes belong to a solving node cluster; an intent-to-solve transaction includes intent information, incentive information, solution information, and solution proof information; the solution information is used for replying to the intention information;

The consensus uplink module 103 is configured to perform consensus uplink processing on a target intent-to-solve transaction when the block link point receives the target intent-to-solve transaction sent by the intent node; the target intention solving transaction is generated according to the summary of N intention solving transactions when the intention node determines that solution information contained in N intention solving transactions passes through the intention information based on solution proof information contained in N intention solving transactions; n is a positive integer, and N intent-to-solve transactions belong to M intent-to-solve transactions; the incentive information is used for indicating that the N solution nodes respectively associated with the intention solution transactions are subjected to incentive processing in the consensus uplink processing process.

The specific implementation manner of the first receiving module 101, the second receiving module 102, and the common uplink module 103 may refer to the specific description of step S101 to step S103 in the embodiment corresponding to fig. 3, and the description is not repeated here.

Wherein the M solution nodes comprise first solution nodes;

the second receiving module 102 includes: a set adding unit 1021, and a transaction transmitting unit 1022.

A set adding unit 1021 for adding an intent-to-solve transaction to the intent-to-solve transaction set when the blockchain node receives an intent-to-solve transaction generated by the first solution node based on the intent-to-solve transaction;

A transaction transmitting unit 1022 configured to determine, when the blockchain node determines that the intention-to-be-resolved duration reaches the intention-to-be-resolved duration threshold, the intention-resolved transactions included in the intention-to-be-resolved transaction set as M intention-resolved transactions, and transmit the M intention-resolved transactions to the intention node.

The specific implementation manner of the aggregate adding unit 1021 and the transaction transmitting unit 1022 may refer to the specific description of step S102 in the embodiment corresponding to fig. 3, which is not described herein.

Wherein, consensus uplink module 103 comprises: a consensus unit 1031, an excitation unit 1032, and a writing unit 1033.

The consensus unit 1031 is configured to send the target intent-to-solve transaction to a consensus node cluster, so that the consensus node cluster performs consensus processing on the target intent-to-solve transaction to obtain a consensus result;

the excitation unit 1032 is configured to perform excitation processing on the N solution nodes according to the excitation information if the consensus result is a consensus passing result, so as to obtain an excitation result; the N solving nodes are respectively associated solving nodes for solving the transaction with N intents;

a writing unit 1033 for writing the incentive result and the target intent-to-solve transaction into the blockchain ledger.

The specific implementation manner of the consensus unit 1031, the excitation unit 1032, and the writing unit 1033 may refer to the specific description of step S103 in the embodiment corresponding to fig. 3, and will not be described herein.

Wherein the excitation unit 1032 includes: the first excitation sub-unit 10321.

The first incentive subunit 10321 is configured to invoke an incentive contract according to the incentive information, determine an incentive total according to the incentive contract, and perform average processing on the incentive total according to N to obtain an average incentive amount;

the first incentive sub-unit 10321 is further configured to allocate incentive resources indicated by the incentive average amount to each of the resolution nodes respectively associated with the intent-to-resolve transactions respectively;

the first excitation subunit 10321 is further configured to determine excitation resource allocation results corresponding to the N solution nodes as excitation results.

The specific implementation manner of the first excitation subunit 10321 may refer to the specific description of step S103 in the embodiment corresponding to fig. 3, which is not repeated herein.

an excitation unit 1032 including: the second excitation sub-unit 10322.

A second incentive subunit 10322, configured to invoke an incentive contract according to the incentive information, and obtain an incentive total through the incentive contract;

The second excitation subunit 10322 is further configured to traverse and obtain an excitation weight corresponding to the ith solution node, and determine an excitation amount corresponding to the ith solution node according to the excitation total and the excitation weight corresponding to the ith solution node; i is a positive integer less than or equal to N;

the second excitation subunit 10322 is further configured to allocate an excitation resource indicated by the excitation amount corresponding to the i-th resolution node;

the second excitation subunit 10322 is further configured to determine excitation resource allocation results corresponding to the N solution nodes as excitation results.

The specific implementation manner of the second excitation subunit 10322 may refer to the specific description of step S103 in the embodiment corresponding to fig. 3, which is not repeated here.

an excitation unit 1032 including: the third excitation sub-unit 10323.

The third incentive subunit 10323 is configured to invoke an incentive contract according to the incentive information, obtain an incentive sum and an incentive distribution rule through the incentive contract, and determine N incentive amounts and incentive priorities corresponding to the N incentive amounts according to the incentive sum, N and the incentive distribution rule; the sum of the N incentive amounts is equal to the incentive sum;

The third excitation subunit 10323 is further configured to traverse and obtain a transaction priority corresponding to the jth resolution node, and determine an excitation amount of which the excitation priority matches with a node priority corresponding to the jth resolution node as the excitation amount corresponding to the jth resolution node; j is a positive integer less than or equal to N;

the third excitation subunit 10323 is further configured to allocate an excitation resource indicated by the excitation amount corresponding to the jth solution node;

the third excitation subunit 10323 is further configured to determine excitation resource allocation results corresponding to the N solution nodes as excitation results.

The specific implementation manner of the third excitation subunit 10323 may refer to the specific description of step S103 in the embodiment corresponding to fig. 3, which is not repeated here.

the data processing apparatus 1 further includes: signature verification module 104.

The signature verification module 104 is configured to obtain a public key of the intention node, verify the intention signature through the public key, and obtain a signature verification result;

the signature verification module 104 is further configured to send a transaction error prompt message to the intention node if the signature verification result is a verification failure result;

The signature verification module 104 is further configured to perform a step of broadcasting the intended transaction to the solution node cluster if the signature verification result is a verification success result.

The specific implementation manner of the signature verification module 104 may refer to the optional description of step S101 in the embodiment corresponding to fig. 3, which is not repeated here.

Referring to fig. 8, fig. 8 is a schematic structural diagram of a computer device according to an embodiment of the present application. As shown in fig. 8, the data processing apparatus 1 in the embodiment corresponding to fig. 7 described above may be applied to a computer device 1000, and the computer device 1000 may include: processor 1001, network interface 1004, and memory 1005, and in addition, the above-described computer device 1000 may further include: a user interface 1003, and at least one communication bus 1002. Wherein the communication bus 1002 is used to enable connected communication between these components. The user interface 1003 may include a Display (Display), a Keyboard (Keyboard), and the optional user interface 1003 may further include a standard wired interface, a wireless interface, among others. The network interface 1004 may optionally include a standard wired interface, a wireless interface (e.g., WI-FI interface). The memory 1005 may be a high-speed RAM memory or a non-volatile memory (non-volatile memory), such as at least one disk memory. The memory 1005 may also optionally be at least one storage device located remotely from the processor 1001. As shown in fig. 8, an operating system, a network communication module, a user interface module, and a device control application may be included in a memory 1005, which is a type of computer-readable storage medium.

In the computer device 1000 shown in fig. 8, the network interface 1004 may provide a network communication network element; while user interface 1003 is primarily used as an interface for providing input to a user; and the processor 1001 may be used to invoke a device control application stored in the memory 1005 to implement:

receiving an intention transaction sent by an intention node, and broadcasting the intention transaction to a solution node cluster; the intent-to-transact includes intent information and incentive information;

It should be understood that the computer device 1000 described in the embodiments of the present application may perform the description of the data processing method in any of the foregoing embodiments corresponding to any of fig. 3, which is not repeated herein. In addition, the description of the beneficial effects of the same method is omitted.

Furthermore, it should be noted here that: the embodiments of the present application further provide a computer readable storage medium, where the aforementioned computer program executed by the data processing apparatus 1 is stored, and the aforementioned computer program includes program instructions, when executed by the aforementioned processor, can execute the description of the aforementioned data processing method in any of the corresponding embodiments of fig. 3, and therefore, a detailed description will not be given here. In addition, the description of the beneficial effects of the same method is omitted. For technical details not disclosed in the embodiments of the computer-readable storage medium according to the present application, please refer to the description of the method embodiments of the present application.

Further, referring to fig. 9, fig. 9 is a schematic structural diagram of another blockchain-based data processing device according to an embodiment of the present application. The data processing means 2 may be a computer program (comprising program code) running in a computer device, for example the data processing means 2 is an application software; the data processing device 2 may be adapted to perform the respective steps of the method provided by the embodiments of the present application. As shown in fig. 9, the data processing apparatus 2 may include: a transaction sending module 201, a transaction receiving module 202, a reply verification module 203 and a transaction summarization module 204.

A transaction transmitting module 201 for transmitting an intention transaction including intention information and incentive information to the block link point so that the block link point broadcasts the intention transaction to the solution node cluster;

a transaction receiving module 202, configured to receive M intent-to-solve transactions sent by a blockchain node; m is a positive integer; the M intention solving transactions are generated by the M solving nodes based on the intention transactions respectively; m solving nodes belong to a solving node cluster; an intent-to-solve transaction includes intent information, incentive information, solution information, and solution proof information; the solution information is used for replying to the intention information;

a reply verification module 203, configured to perform reply verification processing on solution information included in the M intent-to-solve transactions based on solution proof information included in the M intent-to-solve transactions, and determine a reply verification result;

the transaction summarization module 204 is configured to perform transaction summarization processing on N intention solution transactions through which solution information reply intention information indicated by the reply verification result passes, obtain a target intention solution transaction, and send the target intention solution transaction to the blockchain node, so that the blockchain node performs consensus uplink processing on the target intention solution transaction; the incentive information is used for indicating that the N solution nodes respectively associated with the intention solution transactions are subjected to incentive processing in the consensus uplink processing process.

The specific implementation manners of the transaction sending module 201, the transaction receiving module 202, the reply verification module 203, and the transaction summarizing module 204 may be referred to the specific description of step S201 to step S204 in the embodiment corresponding to fig. 4, and will not be described herein.

Wherein the M intent-to-solve transactions include intent-to-solve transaction M _a A is a positive integer less than or equal to M; intent to solve the trafficEasy M _a Containing proof of resolution information for intent to resolve transaction M _a Solution step information corresponding to the contained solution information;

reply verification module 203, comprising: a first verification unit 2031.

A first verification unit 2031 for performing intention resolution processing on the intention information according to the solution step information, to obtain intention resolution information;

the first verification unit 2031 is further configured to, if the intention is to resolve the information and the intention is to resolve the transaction M _a Containing the same solution information, determining that the transaction M is intended to be resolved _a The contained solution information replies to the intended information passing.

The specific implementation of the first verification unit 2031 may be referred to the specific description of step S203 in the embodiment corresponding to fig. 4, which is not described herein.

reply verification module 203, comprising: a second verification unit 2032.

A second verification unit 2032, configured to perform zero knowledge proof verification processing on the zero knowledge proof data according to the zero knowledge verification parameter, to obtain a zero knowledge proof verification processing result;

the second verification unit 2032 is further configured to determine that the transaction M is intended to be resolved if the zero-knowledge proof verification processing result is a zero-knowledge proof verification passing result _a The contained solution information replies to the intended information passing.

The specific implementation of the second verification unit 2032 may be referred to the specific description of step S203 in the embodiment corresponding to fig. 4, which is not described herein.

Wherein the M intent-to-solve transactions include intent-to-solve transaction M _a A is a positive integer less than or equal to M; intent to resolve transaction M _a The contained solution proof information is private key verification prompt information; intent to resolve transaction M _a The contained solution information is encryption solution information; the encryption solution information is obtained by encrypting the original solution information by an encryption public key;

Reply verification module 203, comprising: a third verification unit 2033.

A third verification unit 2033, configured to obtain an encrypted private key corresponding to the encrypted public key according to the private key verification prompt information, and decrypt the encrypted solution information through the encrypted private key to obtain original solution information;

the third verification unit 2033 is further configured to determine a reply result of the original solution information with respect to the intention information;

the third verification unit 2033 is further configured to determine that the transaction M is intended to be resolved if the reply result of the original solution information to the intention information is a reply passing result _a The contained solution information replies to the intended information passing.

The specific implementation of the third verification unit 2033 may be referred to the specific description of step S203 in the embodiment corresponding to fig. 4, which is not described herein.

Further, referring to fig. 10, fig. 10 is a schematic structural diagram of another computer device according to an embodiment of the present application. As shown in fig. 10, the data processing apparatus 2 in the embodiment corresponding to fig. 9 described above may be applied to a computer device 2000, and the computer device 2000 may include: processor 2001, network interface 2004 and memory 2005, in addition, the above-described computer device 2000 further includes: a user interface 2003, and at least one communication bus 2002. Wherein a communication bus 2002 is used to enable connected communications between these components. The user interface 2003 may include a Display screen (Display), a Keyboard (Keyboard), and the optional user interface 2003 may further include a standard wired interface, a wireless interface, among others. The network interface 2004 may optionally include a standard wired interface, a wireless interface (e.g., WI-FI interface). The memory 2005 may be a high-speed RAM memory or a non-volatile memory (non-volatile memory), such as at least one disk memory. The memory 2005 may also optionally be at least one storage device located remotely from the aforementioned processor 2001. As shown in fig. 10, an operating system, a network communication module, a user interface module, and a device control application program may be included in the memory 2005 as one type of computer-readable storage medium.

In the computer device 2000 illustrated in fig. 10, the network interface 2004 may provide network communication functions; while user interface 2003 is primarily an interface for providing input to a user; and processor 2001 may be used to invoke device control applications stored in memory 2005 to implement:

transmitting an intent transaction including intent information and incentive information to the block link point such that the block link point broadcasts the intent transaction to the solving node cluster;

receiving M intent solution transactions sent by a blockchain node; m is a positive integer; the method comprises the steps of carrying out a first treatment on the surface of the M intent-to-solve transactions are generated by M solution nodes based on the intent-to-solve transactions, respectively; m solving nodes belong to a solving node cluster; an intent-to-solve transaction includes intent information, incentive information, solution information, and solution proof information; the solution information is used for replying to the intention information;

It should be understood that the computer device 2000 described in the embodiments of the present application may perform the description of the data processing method in the foregoing embodiments, and may also perform the description of the data processing apparatus 2 in the foregoing embodiment corresponding to fig. 4, which is not repeated herein. In addition, the description of the beneficial effects of the same method is omitted.

Furthermore, it should be noted here that: the embodiments of the present application further provide a computer readable storage medium, in which the aforementioned computer program executed by the data processing apparatus 2 is stored, and when the aforementioned computer program is loaded and executed by the aforementioned processor, the foregoing description of the data processing method in any of the foregoing embodiments can be executed, and therefore, a detailed description will not be given here. In addition, the description of the beneficial effects of the same method is omitted. For technical details not disclosed in the embodiments of the computer-readable storage medium according to the present application, please refer to the description of the method embodiments of the present application.

The computer readable storage medium may be the data processing apparatus provided in any one of the foregoing embodiments or an internal storage unit of the computer device, for example, a hard disk or a memory of the computer device. The computer readable storage medium may also be an external storage device of the computer device, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) card, a flash card (flash card) or the like, which are provided on the computer device. Further, the computer-readable storage medium may also include both internal storage units and external storage devices of the computer device. The computer-readable storage medium is used to store the computer program and other programs and data required by the computer device. The computer-readable storage medium may also be used to temporarily store data that has been output or is to be output.

Furthermore, it should be noted here that: embodiments of the present application also provide a computer program product or computer program comprising computer instructions stored in a computer-readable storage medium. The processor of the computer device reads the computer instructions from the computer readable storage medium and executes the computer instructions to cause the computer device to perform the method provided by the corresponding embodiment of any of the preceding figures 3, 4.

The terms first, second and the like in the description and in the claims and drawings of the embodiments of the present application are used for distinguishing between different objects and not for describing a particular sequential order. Furthermore, the term "include" and any variations thereof is intended to cover a non-exclusive inclusion. For example, a process, method, apparatus, article, or device that comprises a list of steps or elements is not limited to the list of steps or modules but may, in the alternative, include other steps or modules not listed or inherent to such process, method, apparatus, article, or device.

Those of ordinary skill in the art will appreciate that the elements and algorithm steps described in connection with the embodiments disclosed herein may be embodied as electronic hardware, as a computer software, or in a combination of the two, and that the elements and steps of the examples have been generally described in terms of network elements in the foregoing description to clearly illustrate the interchangeability of hardware and software. Whether these network elements are implemented in hardware or software depends on the specific application and design constraints of the solution. The skilled person may use different methods for implementing the described network elements for each specific application, but such implementation should not be considered beyond the scope of the present application.

The foregoing disclosure is only illustrative of the preferred embodiments of the present application and is not intended to limit the scope of the claims herein, as the equivalent of the claims herein shall be construed to fall within the scope of the claims herein.

Claims

1. A blockchain-based data processing method, comprising:

receiving intention solving transactions respectively generated by M solving nodes based on the intention transactions, and sending the M intention solving transactions to the intention nodes; m is a positive integer; the M solution nodes belong to the solution node cluster; an intent-to-solve transaction comprising the intent information, the incentive information, solution information, and solution proof information; the solution information is used for replying to the intention information;

when the block link point receives a target intention solving transaction sent by the intention node, performing consensus uplink processing on the target intention solving transaction; the target intention solving transaction is generated according to the N intention solving transaction summary when the intention node determines that solution information contained in N intention solving transactions passes through the intention information based on solution proof information contained in the N intention solving transactions; n is a positive integer, the N intent-to-solve transactions belong to the M intent-to-solve transactions; and the incentive information is used for indicating to carry out incentive processing on the solution nodes respectively associated with the N intention solution transactions in the consensus uplink processing process.

2. The method of claim 1, wherein the M resolution nodes comprise a first resolution node; the receiving M intent-to-solve transactions generated by the M resolution nodes based on the intent-to-solve transactions, respectively, sending the M intent-to-solve transactions to the intent nodes, including:

adding the intent-to-solve transaction to an intent-to-solve transaction set when the block link point receives an intent-to-solve transaction generated by the first resolution node based on the intent-to-solve transaction;

when the blockchain node determines that the intention-to-wait duration reaches the intention-to-wait duration threshold, determining intention-to-solve transactions contained in the intention-to-solve transaction set as M intention-to-solve transactions, and sending the M intention-to-solve transactions to the intention node.

3. The method of claim 1, wherein the consensus-based uplink processing of the target intent-to-solve transaction comprises:

transmitting the target intention solving transaction to a consensus node cluster, so that the consensus node cluster performs consensus processing on the target intention solving transaction to obtain a consensus result;

if the consensus result is a consensus passing result, performing excitation processing on the N solution nodes according to the excitation information to obtain an excitation result; the N solving nodes are respectively associated solving nodes for the N intention solving transactions;

Writing the incentive result and the target intent-to-solve transaction into a blockchain ledger.

4. The method of claim 3, wherein the performing excitation processing on the N solution nodes according to the excitation information to obtain excitation results includes:

invoking an incentive contract according to the incentive information, determining an incentive total through the incentive contract, and carrying out average processing on the incentive total according to N to obtain an incentive average amount;

allocating incentive resources indicated by the incentive average amount to each solution node respectively associated with each intent-to-solve transaction;

and determining excitation resource allocation results corresponding to the N solution nodes as excitation results.

5. A method according to claim 3, wherein the target intent-to-resolve transaction comprises incentive weights for each of the N resolution nodes;

and performing excitation processing on the N solution nodes according to the excitation information to obtain an excitation result, wherein the excitation processing comprises the following steps:

invoking an incentive contract according to the incentive information, and acquiring an incentive total through the incentive contract;

traversing to obtain the excitation weight corresponding to the ith solution node, and determining the excitation amount corresponding to the ith solution node according to the excitation total sum and the excitation weight corresponding to the ith solution node; i is a positive integer less than or equal to N;

Allocating excitation resources indicated by the excitation amount corresponding to the ith solution node;

and determining the excitation resource allocation results corresponding to the N solution nodes as excitation results.

6. A method according to claim 3, wherein the target intent-to-resolve transaction includes node priorities for each of the N resolution nodes;

invoking an incentive contract according to the incentive information, acquiring an incentive total sum and an incentive distribution rule through the incentive contract, and determining N incentive amounts and incentive priorities corresponding to the N incentive amounts according to the incentive total sum, the N and the incentive distribution rule; the sum of the N incentive amounts is equal to the incentive sum;

traversing to obtain the transaction priority corresponding to the jth solution node, and determining the excitation amount of which the excitation priority is matched with the node priority corresponding to the jth solution node as the excitation amount corresponding to the jth solution node; j is a positive integer less than or equal to N;

allocating excitation resources indicated by the excitation amount corresponding to the j-th solution node;

7. The method of claim 1, wherein the intent-to-trade further includes an intent-to-sign; the intention signature is obtained by signing the intention information through an owned private key by the intention node;

the method further comprises the steps of:

obtaining a public key of the intention node, and verifying the intention signature through the public key to obtain a signature verification result;

if the signature verification result is a verification failure result, sending transaction error prompt information to an intention node;

and if the signature verification result is a verification success result, executing the step of broadcasting the intention transaction to the solution node cluster.

8. A blockchain-based data processing method, comprising:

the intention node transmits an intention transaction comprising intention information and incentive information to a block link point, so that the block link point broadcasts the intention transaction to a solution node cluster;

receiving M intent-to-solve transactions sent by the blockchain node; m is a positive integer; the M intent-to-solve transactions are generated by M solution nodes based on the intent-to-solve transactions, respectively; the M solution nodes belong to the solution node cluster; an intent-to-solve transaction comprising the intent information, the incentive information, solution information, and solution proof information; the solution information is used for replying to the intention information;

carrying out transaction summarization processing on N intention solution transactions through which the solution information indicated by the reply verification result replies to the intention information to obtain target intention solution transactions, and sending the target intention solution transactions to the blockchain node so that the blockchain node carries out consensus uplink processing on the target intention solution transactions; and the incentive information is used for indicating to carry out incentive processing on the solution nodes respectively associated with the N intention solution transactions in the consensus uplink processing process.

9. The method of claim 8, wherein the M intent-to-resolve transactions comprises intent-to-resolve transaction M _a A is a positive integer less than or equal to M; the intent to resolve transaction M _a Containing proof of resolution information for the intent-to-resolve transaction M _a Solution step information corresponding to the contained solution information;

the reply verification processing is performed on the solution information contained in the M intent-to-solve transactions based on the solution proof information contained in the M intent-to-solve transactions, and the determination of the reply verification result includes:

Carrying out intention solving processing on the intention information according to the solution step information to obtain intention solving information;

if the intent-to-resolve information and the intent-to-resolve transaction M _a Containing the same solution information, determining that the intent is to resolve transaction M _a The contained solution information replies to the intended information passing.

10. The method of claim 8, wherein the M intent-to-resolve transactions comprises intent-to-resolve transaction M _a A is a positive integer less than or equal to M; the intent to resolve transaction M _a The included solution proof information comprises zero knowledge proof data and zero knowledge verification parameters; the zero knowledge proof data is for the intent-to-solve transaction M _a The solution information is generated after zero knowledge proof processing;

performing zero knowledge proof verification processing on the zero knowledge proof data according to the zero knowledge verification parameters to obtain a zero knowledge proof verification processing result;

if the zero knowledge proof verification processing result is the zero knowledge proof verification passing result, determining that the intention is to solve the transaction M _a The contained solution information replies to the intended information passing.

11. The method of claim 8, wherein the M intent-to-resolve transactions comprises intent-to-resolve transaction M _a A is a positive integer less than or equal to M; the intent to resolve transaction M _a The contained solution proof information is private key verification prompt information; the intent to resolve transaction M _a The contained solution information is encryption solution information; the encryption solution information is obtained by encrypting the original solution information by an encryption public key;

acquiring an encryption private key corresponding to the encryption public key according to the private key verification prompt information, and decrypting the encryption solution information through the encryption private key to obtain original solution information;

determining a reply result of the original solution information for the intention information;

if the reply result of the original solution information aiming at the intention information is a reply passing result, determining that the intention is to solve the transaction M _a The contained solution information replies to the intended information passing.

12. A blockchain-based data processing device, comprising:

the second receiving module is used for receiving the intention solving transactions respectively generated by the M solving nodes based on the intention transactions and sending the M intention solving transactions to the intention nodes; m is a positive integer; the M solution nodes belong to the solution node cluster; an intent-to-solve transaction comprising the intent information, the incentive information, solution information, and solution proof information; the solution information is used for replying to the intention information;

the consensus uplink module is used for performing consensus uplink processing on the target intention solution transaction when the block link point receives the target intention solution transaction sent by the intention node; the target intention solving transaction is generated according to the N intention solving transaction summary when the intention node determines that solution information contained in N intention solving transactions passes through the intention information based on solution proof information contained in the N intention solving transactions; n is a positive integer, the N intent-to-solve transactions belong to the M intent-to-solve transactions; and the incentive information is used for indicating to carry out incentive processing on the solution nodes respectively associated with the N intention solution transactions in the consensus uplink processing process.

13. A computer device, comprising: a processor, a memory, and a network interface;

the processor is connected to the memory, the network interface for providing data communication functions, the memory for storing program code, the processor for invoking the program code to perform the method of any of claims 1-11.

14. A computer readable storage medium, characterized in that the computer readable storage medium has stored therein a computer program adapted to be loaded by a processor and to perform the method of any of claims 1-11.

15. A computer program product comprising computer programs/instructions which, when executed by a processor, are adapted to carry out the method of any one of claims 1-11.