CN113807968B

CN113807968B - Block chain user request processing method and device, entrusting server and storage medium

Info

Publication number: CN113807968B
Application number: CN202111107700.7A
Authority: CN
Inventors: 王挺; 胡志鹏; 顾费勇; 曹崇瑞; 李刚锐; 胡志敏
Original assignee: Netease Hangzhou Network Co Ltd
Current assignee: Netease Hangzhou Network Co Ltd
Priority date: 2021-09-22
Filing date: 2021-09-22
Publication date: 2024-02-23
Anticipated expiration: 2041-09-22
Also published as: CN113807968A

Abstract

The invention provides a block chain user request processing method, a device, a entrusting server and a storage medium, and relates to the technical field of data processing. The user request processing method comprises the following steps: receiving at least one user processing request sent by a first client, wherein each user processing request is used for indicating a blockchain node to process first user identification information, and the first user identification information is identification information of a first user corresponding to the first client; combining the user processing requests received in a preset time period to obtain combined user processing requests; and calling the block chain node according to the user processing request after the combination processing so as to enable the block chain node to process according to the user processing request after the combination processing. And combining at least one user processing request, wherein the at least one user processing request only needs to call the blockchain once, so that the blockchain transaction pressure is reduced, and the transaction stability is improved.

Description

Block chain user request processing method and device, entrusting server and storage medium

Technical Field

The present invention relates to the field of data processing technologies, and in particular, to a method and apparatus for processing a blockchain user request, a trusted server, and a storage medium.

Background

With the development of scientific technology, the technology of the blockchain is also developed rapidly, the blockchain is a shared database, and data or information stored in the shared database has the characteristics of incapability of forging, whole-course trace, traceability, openness, transparency and collective maintenance, and the blockchain is widely applied to a plurality of industries and fields. The interaction between clients and blockchains to process data in blockchains is also a hotspot for research.

In the related art, a client corresponding to each user may send a request to a proxy server, where the request is used to instruct the blockchain to process the user identification information, and the proxy server may invoke the blockchain to process the user identification information.

However, in the related art, when a plurality of clients each send a user request to the client server, the client server needs to call the blockchain multiple times, and there is a problem that the blockchain transaction pressure is too high, resulting in abnormal transactions.

Disclosure of Invention

The invention aims to overcome the defects in the prior art and provide a blockchain user request processing method, a device, a consignment server and a storage medium, so as to solve the problem that when a plurality of clients send user requests to the consignment server in the related art, the consignment server needs to call a blockchain for a plurality of times, and the transaction abnormality is easy to occur due to overlarge blockchain transaction pressure.

In order to achieve the above purpose, the technical scheme adopted by the embodiment of the invention is as follows:

in a first aspect, an embodiment of the present invention provides a blockchain user request processing method, which is applied to a proxy server, and includes:

receiving at least one user processing request sent by a first client, wherein each user processing request is used for indicating a blockchain node to process first user identification information, and the first user identification information is identification information of a first user corresponding to the first client;

combining the user processing requests received in a preset time period to obtain combined user processing requests;

and calling a blockchain node according to the user processing request after the combination processing so that the blockchain node processes according to the user processing request after the combination processing.

Optionally, the merging processing is performed on the user processing request received in the preset time period to obtain a user processing request after the merging processing, including:

and converging the user processing requests received in the preset time period to a to-be-uplink queue to obtain the user processing requests after the combination processing.

Optionally, before the block chain node is called according to the user processing request after the merging processing, the method further includes:

Randomly generating operation identification information;

creating a target object according to the operation identification information, the user processing request and a preset thread waiting tool;

and storing the target object into the queue to be uplink.

Optionally, after the invoking the blockchain node according to the user processing request after the merging processing, the method further includes:

if a first user identification information change event from the blockchain node is monitored, analyzing the first user identification information change event to obtain an analysis result, wherein the analysis result comprises the following steps: the operation identification information and the first user identification information, wherein the first user identification information change event indicates that the processing is successful;

and transmitting the successful processing result to the first client through the target object according to the operation identification information and the first user identification information.

Optionally, the transmitting, according to the operation identification information and the first user identification information, the result of the successful processing to the first client through the target object includes:

searching the target object according to the operation identification information to obtain a searching result;

If the searching result indicates that the target object is searched, writing the result of successful processing and the first user identification information into the target object;

and waking up the preset thread waiting tool in the target object to wake up a first user identification information thread, and transmitting the successful processing result to the first client.

Optionally, the method further comprises:

and deleting the user identification document data corresponding to the first user identification information in the user identification cache list, and determining deletion notification information.

And transmitting the deletion notification information to the first client through the first user identification information thread.

Optionally, the method further comprises:

and if the searching result indicates that the target object is not searched, deleting the user identification document data corresponding to the first user identification information in the user identification cache list.

Optionally, the method further comprises:

and if a first user identification information change event from the blockchain node is monitored, deleting the user identification document data corresponding to the first user identification information in the user identification cache list.

Optionally, the method further comprises:

receiving a user query request sent by a second client, wherein the user query request comprises: second user identification information;

Inquiring a local cache according to the second user identification information to obtain a local inquiry result;

and if the local query result indicates that the target user identification document data corresponding to the second user identification information is found, sending the target user identification document data to the second client.

Optionally, the querying the local cache according to the second user identification information to obtain a local query result includes:

and obtaining the local query result through a user identification cache list according to the second user identification information, wherein the user identification cache list comprises a plurality of preset user identification document data.

Optionally, the method further comprises:

if the local query result indicates that the target user identification document data is not found, invoking the blockchain node to acquire account information of the second user identification information;

recovering the target user identification document data according to the account information;

and sending the target user identification document data to the second client.

Optionally, the method further comprises:

and caching the target user identification document data within a preset time length.

And updating the user identification cache list according to the user identification document data.

Optionally, the method further comprises:

verifying the user processing request to obtain a verification result, wherein the verification result is used for indicating whether verification is successful or not;

the step of combining the user processing requests received in the preset time period to obtain combined user processing requests comprises the following steps:

and according to the verification result, merging at least one user processing request which is successfully verified, so as to obtain a merged user processing request.

Optionally, the user processing request is a user creation request or a user modification request;

the user creation request is used for indicating creation of the first user identification information, and the user modification request is used for indicating modification of the first user identification information.

In a second aspect, an embodiment of the present invention further provides a blockchain user request processing device, which is applied to a proxy server, including:

the system comprises a receiving module, a processing module and a processing module, wherein the receiving module is used for receiving at least one user processing request sent by a first client, each user processing request is used for indicating a blockchain node to process first user identification information, and the first user identification information is identification information of a first user corresponding to the first client;

The processing module is used for carrying out combination processing on the user processing requests received in a preset time period to obtain user processing requests after combination processing;

and the calling module is used for calling the blockchain node according to the user processing request after the combination processing so as to enable the blockchain node to process according to the user processing request after the combination processing.

Optionally, the processing module is further configured to aggregate the user processing request received in the preset time period to a to-be-uplink queue, so as to obtain the user processing request after the merging processing.

Optionally, the apparatus further includes:

the generation module is used for randomly generating operation identification information;

the creation module is used for creating a target object according to the operation identification information, the user processing request and a preset thread waiting tool;

and the storage module is used for storing the target object into the to-be-uplink queue.

Optionally, the apparatus further includes:

the first analysis module is configured to, if a first user identification information change event from the blockchain node is monitored, analyze the first user identification information change event to obtain an analysis result, where the analysis result includes: the operation identification information and the first user identification information, wherein the first user identification information change event indicates that the processing is successful;

And the first transmission module is used for transmitting the successful processing result to the first client through the target object according to the operation identification information and the first user identification information.

Optionally, the first transmission module is further configured to search the target object according to the operation identification information, so as to obtain a search result; if the searching result indicates that the target object is searched, writing the result of successful processing and the first user identification information into the target object; and waking up the preset thread waiting tool in the target object to wake up a first user identification information thread, and transmitting the successful processing result to the first client.

Optionally, the apparatus further includes:

the first deleting module is used for deleting the user identification document data corresponding to the first user identification information in the user identification cache list and determining deleting notification information.

And the second transmission module is used for transmitting the deletion notification information to the first client through the first user identification information thread.

Optionally, the apparatus further includes:

and the second deleting module is used for deleting the user identification document data corresponding to the first user identification information in the user identification cache list if the searching result indicates that the target object is not searched.

Optionally, the apparatus further includes:

and the second analysis module is used for deleting the user identification document data corresponding to the first user identification information in the user identification cache list if the first user identification information change event from the blockchain node is monitored.

Optionally, the apparatus further includes:

the first receiving module is configured to receive a user query request sent by the second client, where the user query request includes: second user identification information;

the query module is used for querying the local cache according to the second user identification information to obtain a local query result;

and the first sending module is used for sending the target user identification document data to the second client if the local query result indicates that the target user identification document data corresponding to the second user identification information is searched.

Optionally, the query module is further configured to obtain the local query result through a user identifier cache list according to the second user identifier information, where the user identifier cache list includes a plurality of preset user identifier document data.

Optionally, the apparatus further includes:

the acquisition module is used for calling the blockchain node to acquire account information of the second user identification information if the local query result indicates that the target user identification document data is not found;

The recovery module is used for recovering the target user identification document data according to the account information;

and the second sending module is used for sending the target user identification document data to the second client.

Optionally, the apparatus further includes:

and the caching module is used for caching the target user identification document data within a preset duration.

And the updating module is used for updating the user identification cache list according to the user identification document data.

Optionally, the apparatus further includes:

the verification module is used for verifying the user processing request to obtain a verification result, and the verification result is used for indicating whether the verification is successful or not;

and the processing module is used for carrying out combination processing on at least one user processing request which is successfully verified according to the verification result to obtain a user processing request after combination processing.

Optionally, the user processing request is a user creation request or a user modification request; the user creation request is used for indicating creation of the first user identification information, and the user modification request is used for indicating modification of the first user identification information.

In a third aspect, an embodiment of the present invention further provides a proxy server, including: a memory storing a computer program executable by the processor, and a processor implementing the method of any one of the first aspects when the processor executes the computer program.

In a fourth aspect, an embodiment of the present invention further provides a storage medium, where a computer program is stored, where the computer program is read and executed to implement the method according to any one of the first aspects.

The beneficial effects of the invention are as follows: the embodiment of the invention provides a block chain user request processing method, which comprises the following steps: receiving at least one user processing request sent by a first client, wherein each user processing request is used for indicating a blockchain node to process first user identification information, and the first user identification information is identification information of a first user corresponding to the first client; combining the user processing requests received in a preset time period to obtain combined user processing requests; and calling the block chain node according to the user processing request after the combination processing so as to enable the block chain node to process according to the user processing request after the combination processing. And combining at least one user processing request, wherein the at least one user processing request only needs to call the blockchain once, so that the blockchain transaction pressure is reduced, and the transaction stability is improved.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings that are needed in the embodiments will be briefly described below, it being understood that the following drawings only illustrate some embodiments of the present invention and therefore should not be considered as limiting the scope, and other related drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.

Fig. 1 is a schematic structural diagram of a user request processing system according to an embodiment of the present application;

FIG. 2 is a flowchart of a block chain user request processing method according to an embodiment of the present invention;

FIG. 3 is a flowchart of a block chain user request processing method according to an embodiment of the present invention;

FIG. 4 is a flowchart of a block chain user request processing method according to an embodiment of the present invention;

FIG. 5 is a flowchart of a block chain user request processing method according to an embodiment of the present invention;

FIG. 6 is a flowchart of a block chain user request processing method according to an embodiment of the present invention;

FIG. 7 is a flowchart of a block chain user request processing method according to an embodiment of the present invention;

FIG. 8 is a flowchart of a block chain user request processing method according to an embodiment of the present invention;

FIG. 9 is a schematic diagram of a block chain user request processing device according to an embodiment of the present invention;

fig. 10 is a schematic structural diagram of a proxy server according to an embodiment of the present invention.

Detailed Description

For the purpose of making the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention, and it is apparent that the described embodiments are some embodiments of the present invention, but not all embodiments of the present invention.

Thus, the following detailed description of the embodiments of the present application, as provided in the accompanying drawings, is not intended to limit the scope of the application, as claimed, but is merely representative of selected embodiments of the 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.

In the description of the present application, it should be noted that, if the terms "upper", "lower", and the like indicate an azimuth or a positional relationship based on the azimuth or the positional relationship shown in the drawings, or an azimuth or the positional relationship that is commonly put when the product of the application is used, it is merely for convenience of description and simplification of the description, and does not indicate or imply that the apparatus or element to be referred to must have a specific azimuth, be configured and operated in a specific azimuth, and therefore should not be construed as limiting the present application.

Furthermore, the terms first, second and the like in the description and in the claims and in the above-described figures, are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that the embodiments of the invention described herein may be implemented in sequences other than those illustrated or otherwise described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.

It should be noted that, without conflict, features in embodiments of the present application may be combined with each other.

The terms involved in the embodiments of the present application are explained below:

distributed identity identification: the distributed identity identifier (Decentralized Identifiers, DID) is a decentralised verifiable digital identifier and has the characteristics of being distributed, independently controllable, cross-chain multiplexing and the like. The entity can autonomously complete the registration, resolution, update or revocation operation of the DID. The DID is specifically parsed into DID documents (DID documents) that include unique identification codes for the DID, a list of public keys and detailed information of the public keys (holder, encryption algorithm, key status, etc.), and other attribute descriptions of the DID holder.

The declaration may be verified: verifiable claims (Verifiable Credential, VC) provide a specification describing certain attributes an entity has to enable evidence-based trust. The DID holder may prove to other entities (individuals, organizations, concrete things, etc.) that certain properties of himself may be trusted through VC.

The issuer: entities having user data and capable of developing VC, such as hospitals, banks, universities, etc. institutions and organizations.

The holder is the user: the holder requests, receives, holds the entity of the VC from the issuer, presents the VC to the verifier. The prescribed VC can be stored by itself, and is convenient to reuse later.

The holder may register the DID and query the DID document, the issuer registers the DID and becomes the issuer, the user of the holder applies for VC, the issuer verifies that the DID issues VC, the user of the holder provides VC to the verifier, the verifier verifies the holder/issuer/signature information, and the like, and the verifier may also invoke the issuer to check the VC status.

In addition, a holder may transfer one or more VCs to other holders; the holder may present one or more VCs to the verifier, and optionally present VPs; the verifier may verify the authenticity of the rendered VCs and VPs (here also including checking the revocation status of the VCs); the issuer may revoke VC; the holder may delete the VC.

Fig. 1 is a schematic structural diagram of a user request processing system according to an embodiment of the present application, as shown in fig. 1, where the user request processing system may include: the block chain 101, a plurality of user devices 102, and a proxy server 103, each user device 102 is communicatively connected to the proxy server 103, and the proxy server 103 is communicatively connected to the block chain 101.

Wherein, each user device 102 may have a first client or a second client installed thereon, where the first client and the second client may be the same type of client or different types of clients. The number of the first clients and the second clients may be plural, and the plurality of first clients and the plurality of second clients may communicate with the proxy server 103.

It should be noted that the first client may be a holder client corresponding to a holder user, and the second client may be any one of a holder client, an issuer client, and a verifier client, where the issuer client is a client corresponding to an issuer, and the verifier client is a client corresponding to a verifier.

In some implementations, the at least one first client can send at least one user processing request to the proxy server 103; the delegation server 103 may receive the at least one user processing request, and perform a combination process on the user processing request received in the preset time period, to obtain a user processing request after the combination process; and then invoking the blockchain point 1011 in the blockchain 101 according to the merged user processing request, so that the blockchain point 1011 processes according to the merged user processing request.

Wherein the user processing request is used to instruct the block link point 1011 to process the first user identification information.

In the embodiment of the present application, the user device 102 may be a terminal device, for example, any one of a smart phone, a desktop computer, a notebook computer, and a tablet computer. The blockchain 101 refers to a system for sharing data between nodes, one blockchain 101 may include a plurality of blocklink points 1011, and the plurality of blocklink points 1011 may refer to each server in the blockchain 101, and of course, one server in the blockchain 101 may correspond to the plurality of blocklink points 1011.

The delegation server may be deployed with a plurality of delegation services, and optionally, the delegation server may execute the blockchain user request processing method provided in the embodiments of the present application based on the delegation service, and the blockchain user request processing method provided in the embodiments of the present application is explained below using the delegation server as an execution body.

Fig. 2 is a flow chart of a block chain user request processing method according to an embodiment of the present invention, where, as shown in fig. 2, the method may include:

s101, receiving at least one user processing request sent by a first client.

Wherein each user processing request is for instructing the blockchain node to process the first user identification information. The first user identification information is identification information of a first user corresponding to the first client.

In some embodiments, the first client generates a first user processing request in response to an input processing operation and sends at least one user processing request to the proxy server, which may receive the at least one user processing request. Wherein the first client may be at least one different client.

Alternatively, the first user identification information may be a distributed identity identifier DID.

S102, combining the user processing requests received in a preset time period to obtain the user processing requests after the combination processing.

The user processing request after the combination processing can be a batch user processing request.

In the embodiment of the application, the proxy server can aggregate the user processing requests received in the preset time period, so as to realize the merging processing of the user processing requests received in the preset time period, and obtain the user processing requests after the merging processing.

The preset time period may be 3s (seconds), may be 5s, or may be set according to an actual situation or an empirical value, which is not particularly limited in the embodiment of the present application.

S103, calling the block chain nodes according to the user processing request after the combination processing, so that the block chain nodes are processed according to the user processing request after the combination processing.

In some embodiments, the proxy server may obtain the user processing request after the merging processing to be uplink, and perform merging uplink, and call the contract uplink interface. Accordingly, the blockchain nodes in the blockchain can be processed according to the user processing request after the merging processing.

In this embodiment of the present application, the blockchain node may perform a corresponding transaction according to different types of user processing requests, and after the transaction is completed, output a block, and feed back a processing result to the delegation server, where the delegation server may feed back the processing result to the first client.

In addition, at least one first client may wait for the processing result of the block link point for the user processing request in synchronization.

In summary, an embodiment of the present invention provides a method for processing a blockchain user request, including: receiving at least one user processing request sent by a first client, wherein each user processing request is used for indicating a blockchain node to process first user identification information, and the first user identification information is identification information of a first user corresponding to the first client; combining the user processing requests received in a preset time period to obtain combined user processing requests; and calling the block chain node according to the user processing request after the combination processing so as to enable the block chain node to process according to the user processing request after the combination processing. And combining at least one user processing request, wherein the at least one user processing request only needs to call the blockchain once, so that the blockchain transaction pressure is reduced, and the transaction stability is improved.

Optionally, the user processing request is a user creation request or a user modification request; the user creation request is for indicating creation of the first user identification information, and the user modification request is for indicating modification of the first user identification information.

Wherein the user creation request may include: creating parameters and signature data; the user change request may include: first user identification information, modification parameters, signature data. The signature data may be data obtained after the first client signs the creation parameter or the modification parameter by using a preset blockchain signature algorithm through a private key.

Alternatively, the preset blockchain signature algorithm may be a Secp256k1 elliptic curve signature algorithm. Representing the creation parameter or the modification parameter as changeInfo, the private key may be represented as privateKey, and the signature data may be represented as sign=secp256 k1Sign (changeInfo, privateKey).

It should be noted that, creating parameters or changing parameters includes: public key information (denoted as verifiationmethod) of the first user identification information account, holder, held service information, creation time, modification time, recovery account, and the like.

Optionally, the method may further include: and verifying the user processing request to obtain a verification result. The verification result is used for indicating whether verification is successful or not.

In this embodiment of the present application, if the user processing request is a user creation request, information (public keyhex) in the public key must be public key information corresponding to the blockchain private key, and signing is performed based on the current private key information, so as to ensure that the front blockchain account has control over the created first user identification information. If the user processing request is a user change request, the public key corresponding to the signature data must exist in the public key information in the first user identification document.

In some embodiments, the proxy server may adopt a preset verification algorithm to verify the signature data in the user processing request, if the user processing request is a user creation request, obtain validity of the public key message verification signature in the creation parameter, if verification is invalid, return to the first client to verify failure, and if verification is valid, wait to create the first user identification information. If the user processing request is a user changing request, a public key message in a first user identification information document on the blockchain is obtained, and the signature is verified by a corresponding algorithm. And verifying the validity of the signature, returning to failure of the user if the signature is invalid, and waiting for changing the first user identification information if the signature is valid.

The preset verification algorithm may be expressed as:

flag＝verifySecp256k1Signature(changeInfo，sign，publicKey)

optionally, the step of merging the user processing requests received in the preset time period in S102 to obtain the merged user processing request may include: and carrying out combination processing on at least one user processing request which is successfully verified according to the verification result, and obtaining the user processing request after combination processing.

Optionally, the step of merging the user processing requests received in the preset time period in S102 to obtain the merged user processing request may include: and converging the user processing requests received in the preset time period to a to-be-uplink queue to obtain the user processing requests after the combination processing.

In one possible implementation manner, the proxy server may aggregate the user creation request and/or the user modification request that are successfully authenticated together, and add the user creation request and/or the user modification request to the to-be-uplink queue, so as to obtain the user processing request after the merging processing.

The implementation program code of this process is as follows:

the// pending ul queue

ArrayBlockingQueue<DIDChange>waitOnChainQueue＝newArrayBlockin gQueue<DIDChange>(10000)；

Map of result to be obtained

Map<String,DIDChange>waitDIDChangeMap＝new HashMap<>()；

The// DID entrusting service adds the request to the to-be-uplinked queue and obtains the map of the result

public DIDChange addDIDChangeRequest(String did,String changeInfo){

Generation of unique number for this operation

String generateNumber＝GenerateUtils.generateOrderId(new Date())；

New created object

DIDChange didChange＝new DIDChange()；

didChange.setNumber(generateNumber)；

didChange.setDid(did)；

didChange.setChangeInfo(changeInfo)；

didChange.setCountDownLatch(new CountDownLatch(1))；

The queue to be uplink is added/and the map created by the result is waited

waitDIDChangeMap.put(generateNumber，didChange)；

waitOnChainQueue.offer(didChange)；

return didChange；

}

In this embodiment of the present application, the proxy server may continuously poll the to-be-uplink queue, obtain N user processing requests after the merging processing, and call the contract uplink interface.

The implementation program code of this process is as follows:

inquiry acquisition queue request

public void pollDIDBlocking(){

while(true){

One-time acquisition of N

List<DIDChange>list＝new ArrayList<>(waitOnChainQueue.size())；

waitOnChainQueue.drainTo(list)；

Execution of N transactions

}

Optionally, fig. 3 is a flowchart of a blockchain user request processing method according to an embodiment of the present invention, as shown in fig. 3, before the step of calling the blockchain node according to the combined processed user processing request in S103, the method may further include:

s301, operation identification information is randomly generated.

The operation identification information may be a unique identification of the operation, and the operation identification information may be expressed as a generateNumber.

S302, creating a target object according to the operation identification information, the user processing request and a preset thread waiting tool.

Wherein the user processing request may include the first user identification information of the operation, create a parameter or modify a parameter.

In some embodiments, the proxy server creates the target object based on the operation identification information, the first user identification information of the operation, the creation/modification parameters, the preset thread waiting tool. Wherein the thread waiting tool may be represented by countdown latch and the target object may be represented by DIDChange.

S303, storing the target object into a queue to be uplink.

The waiting-to-be-uplink queue may be represented as waitOnChainQueue.

It should be noted that, the proxy server may store the target object in the to-be-uplink queue, and may also store the target object in the to-be-obtained result, where the operation identification information is used as a key, the target object DIDChange is used as a value, and the to-be-obtained result may be represented as map waitDIDChangeMap.

In the embodiment of the present application, the delegation server may call a contractual linking interface, the uplink interface may be denoted as a batchChangedDID, and the input parameters of the uplink interface may include: the first user identification information address list, the change message list and the operation identification information. Wherein the first subscriber identity information address list may be denoted as idenityist and the change message list may be denoted as changeInfoList.

The blockchain node may sequentially cycle the first user identification information address list, and if the first user identification information exists, the intelligent contract of the blockchain node performs a change operation, performs respective changes of each first user identification information, triggers a first user identification information change event, and the first user identification information may be denoted as DIdAttributeChanged. If the first user identification information does not exist, the intelligent contract of the blockchain node executes the new adding operation, executes the respective new adding of each first user identification information, and then finally triggers a first user identification information change event.

The implementation program code of this process is as follows:

event// did parameter// did address// single number information

event DIdAttributeChanged(address identity,string generateNumber)；

The/batch creation or modification did identityList did address, changeInfoList change message including creation information/public key message/authorized public key list, etc., unique list function batchChangeDID (address [ ] identifier list, string [ ] changeInfoList, string [ ] generator number list) public { of this operation

The address of the// cyclic di

for(uint i＝0；i<identityList.length；i++){

address identity＝identityList[i]；

if(identity！＝0){

Operation of// change business

DIdAttributeChanged(identity,generateNumberList[i])；

}else{

Operation of the// new business

DIdAttributeChanged(identity,generateNumberList[i])；

}

Optionally, fig. 4 is a flowchart of a blockchain user request processing method according to an embodiment of the present invention, as shown in fig. 4, after the step of calling the blockchain node according to the user processing request after the merging processing in S103, the method may further include:

s401, if a first user identification information change event from a blockchain node is monitored, analyzing the first user identification information change event to obtain an analysis result.

The analysis result may include: the operation identification information and the first user identification information, wherein the first user identification information change event indicates that the processing is successful.

In addition, the first user identification information change event may include: first user identification information and operation identification information.

In some embodiments, after the transaction is completed and the block is exported, the blockchain node will send the first user identification information change event to the delegate server to subscribe to the delegate service of the current first user identification information contract; the entrusting server monitors the first user identification information change event through entrusting service, and analyzes the first user identification information change event to obtain an analysis result.

S402, transmitting a successful processing result to the first client through the target object according to the operation identification information and the first user identification information.

In this embodiment of the present application, the proxy server may determine the target object according to the operation identification information, and wait for the tool to wake up based on the thread in the target object, which indicates that the first user identification information creates a result, and then return the target object to the user. If the new establishment is established, the first client can acquire the latest first user identification information; if the change is made, the first client may also obtain a successful change.

The implementation program code of this process is as follows:

the// user thread waits for results

public DIDChange waitDIDChangeResult(DIDChange didChange){

try{

didChange.getCountDownLatch().await()；

}catch(InterruptedException e){

e.printStackTrace()；

}

return didChange；

}

Optionally, fig. 5 is a flowchart of a blockchain user request processing method according to the embodiment of the present invention, as shown in fig. 5, in S402, a process of transmitting, according to the operation identification information, the result of successful processing to the first client through the target object may include:

S501, searching a target object according to the operation identification information to obtain a searching result.

The entrusting server can inquire the result to be obtained according to the operation identification information to obtain a searching result. The search result may indicate whether the target object is found. The key of the result to be obtained is operation identification information, and the value is a target object.

S502, if the searching result indicates that the target object is searched, writing the result of successful processing and the first user identification information into the target object.

In some implementations, the target object may include: creation/modification is successful and the first user identification information.

S503, waking up a preset thread waiting tool in the target object so as to wake up the first user identification information thread, and transmitting a successful processing result to the first client.

In some embodiments, waiting for the tool to wake up based on the thread in the target object indicates that the first user identification information created a result, at which point the target object may be returned to the user. If the new establishment is established, the first client can acquire the latest first user identification information; if the first client is changed, the first client can acquire the information of successful change.

Optionally, fig. 6 is a flow chart of a blockchain user request processing method according to an embodiment of the present invention, as shown in fig. 6, the parsing result further includes: first user identification information; the method further comprises the steps of:

S601, deleting user identification document data corresponding to the first user identification information in the user identification cache list, and determining deletion notification information.

S602, transmitting the deleting notification information to the first client through the first user identification information thread.

It should be noted that, the user identification cache list can be updated timely, the accuracy of querying the user identification cache list is improved, and the deletion notification information is transmitted to the first client, so that the user of the first client can know in time that the user identification document data corresponding to the first user identification information in the user identification cache list is deleted.

Moreover, the delegation service on the delegation server can subscribe the fid contract event of the current blockchain node, so that the blockchain node can conveniently subscribe the fid change event through all subscribers, and the cache can be cleared and the user thread can be notified. This ensures that the bid cache data for the user query must be up-to-date.

Optionally, the method further comprises: and if the searching result indicates that the target object is not searched, deleting the user identification document data corresponding to the first user identification information in the user identification cache list.

If the target object is found, the description indicates that the corresponding user thread does not exist in the client server of the client server, and the first client does not need to be notified.

The implementation program code of this process is as follows:

event outcome of a// snoop

public void noticeBlockchainEvent(){

//event DIdAttributeChanged(address identity,string generateNumber)；

Generating single number by/(and acquiring event did-identity and generateNumber

String generateNumber＝resolveGenerateNumberByEvent()；

String identity＝resolveDIDByEvent()；

Obtaining DIDChange according to genenumber, writing in result, and waking up user waiting thread

DIDChange didChange＝waitDIDChangeMap.get(generateNumber)；

if(didChange！＝null){

didChange.setDid(identity)；

didChange.setResult(true)；

didChange.getCountDownLatch().countDown()；

waitDIDChangeMap.remove(didChange)；

}

Clearing cache according to the dididenity

didCacheMap.remove(identity)；

}

Optionally, the method may further include:

and if the first user identification information change event from the blockchain node is monitored, deleting the user identification document data corresponding to the first user identification information in the user identification cache list.

In some embodiments, if the first user identification information is changed, the delegation server notifies the delegation service of each subscription block event through the blockchain subscription function, and the delegation service can monitor the first user identification information change event and analyze the first user identification information change event to obtain an analysis result; the analysis result may include: first user identification information; and deleting the user identification document data corresponding to the first user identification information in the user identification cache list.

In summary, through the blockchain subscription function, the cache of the user identification document data corresponding to the first user identification information can be notified to be deleted in real time, timely cache cleaning can be achieved, timeliness of the cache list and the user identification document data can be guaranteed, and then the latest data queried from the cache list each time can be guaranteed.

Optionally, fig. 7 is a flowchart of a blockchain user request processing method according to an embodiment of the present invention, as shown in fig. 7, the receiving a user query request sent by a second client, where the user query request includes: second user identification information; the method may further comprise:

s701, inquiring the local cache according to the second user identification information to obtain a local inquiry result.

S702, if the local query result indicates that the target user identification document data corresponding to the second user identification information is found, the target user identification document data is sent to the second client.

In the embodiment of the application, the second client side queries through the local cache every time when acquiring the target user identification document data, so that the query performance is improved, and the query pressure of the blockchain is reduced.

Optionally, in the step S701, according to the second user identification information, a process of querying the local cache to obtain a local query result may include: and according to the second user identification information, obtaining a local query result through the user identification cache list.

The user identification cache list comprises a plurality of preset user identification document data. The user identification cache list may be expressed as a diddachemap.

In some embodiments, the user identification cache list may include: the trust server can search the target preset user identification information which is the same as the second user identification information according to the mapping relation between each preset user identification information and each preset user identification document data, and takes the preset user identification document data corresponding to the target preset user identification information as the target user identification document data.

Optionally, fig. 8 is a flowchart of a blockchain user request processing method according to an embodiment of the present invention, as shown in fig. 8, where the method may further include:

s801, if the local query result indicates that the target user identification document data is not found, invoking a blockchain node to acquire account information of second user identification information.

The delegation server can acquire account information from the account of the second user identification information.

In addition, the account information may include: parameters such as public key, holder, held service information, creation time, modification time, recovery public key, etc.

S802, recovering the target user identification document data according to the account information.

S803, the target user identification document data is sent to the second client.

It should be noted that, the proxy server may send the target user identification document data to the second client, and the second client may receive the target user identification document data, and then display and/or store the target user identification document data.

The implementation program code of this process is as follows:

querying a did document by a diddachemap

public String queryDIDDocumentByDID(String did){

Pulling from local cache if ditcachemap local cache exists

if(didCacheMap.containsKey(did)){

return didCacheMap.get(did)；

}else{

If it is not, pull from blockchain and put into cache

String dIDDocument＝queryByBlockChain(did)；

didCacheMap.put(did,dIDDocument)；

return dIDDocument；

}

Optionally, the method may further include: and caching the target user identification document data within a preset time length. And updating the user identification cache list according to the user identification document data.

The delegation server can store the user identification document data into the user identification cache list. In addition, the preset duration may be 5s or 7s, or may be set according to actual requirements, which is not specifically limited in the embodiment of the present application.

In summary, an embodiment of the present invention provides a blockchain user request processing method, which may include: receiving at least one user processing request sent by a first client, wherein each user processing request is used for indicating a blockchain node to process first user identification information, and the first user identification information is identification information of a first user corresponding to the first client; combining the user processing requests received in a preset time period to obtain combined user processing requests; and calling the block chain node according to the user processing request after the combination processing so as to enable the block chain node to process according to the user processing request after the combination processing. And combining at least one user processing request received in a preset time period, wherein the at least one user processing request only needs to call the blockchain once, so that the blockchain transaction pressure is reduced, and the transaction stability is improved.

And the second client side queries through the local cache every time when acquiring the target user identification document data, so that the query performance is improved, and the query pressure of the blockchain is reduced. Through the function of subscribing events by the blockchain, the user identification information cache can be deleted in real time, and the timeliness of the user identification information cache is ensured.

The following describes a blockchain user request processing device, a delegation server, a storage medium, and the like for executing the blockchain user request processing method provided in the present application, and specific implementation processes and technical effects thereof refer to relevant contents of the blockchain user request processing method, which are not described in detail below.

Fig. 9 is a schematic structural diagram of a blockchain user request processing device according to an embodiment of the present invention, where the device is applied to a proxy server, and as shown in fig. 9, the device may include:

the receiving module 901 is configured to receive at least one user processing request sent by a first client, where each user processing request is used to instruct a blockchain node to process first user identification information, where the first user identification information is identification information of a first user corresponding to the first client;

The processing module 902 is configured to perform a combination process on the user processing request received in the preset time period, so as to obtain a user processing request after the combination process;

and the invoking module 903 is configured to invoke a blockchain node according to the user processing request after the merging process, so that the blockchain node performs processing according to the user processing request after the merging process.

Optionally, the processing module 902 is further configured to aggregate the user processing request received in the preset period of time to a to-be-uplink queue, so as to obtain the user processing request after the combination processing.

Optionally, the apparatus further includes:

the analysis module is used for analyzing the first user identification information change event if the first user identification information change event from the blockchain node is monitored, so as to obtain an analysis result, wherein the analysis result comprises the following steps: the operation identification information and the first user identification information, wherein the first user identification information change event indicates that the processing is successful;

Optionally, the apparatus further includes:

and the processing module 902 is configured to combine at least one user processing request that is successfully verified according to the verification result, so as to obtain a combined user processing request.

The foregoing apparatus is used for executing the method provided in the foregoing embodiment, and its implementation principle and technical effects are similar, and are not described herein again.

The above modules may be one or more integrated circuits configured to implement the above methods, for example: one or more application specific integrated circuits (Application Specific Integrated Circuit, ASIC), or one or more microprocessors (DSP), or one or more field programmable gate arrays (Field Programmable Gate Array, FPGA), etc. For another example, when a module above is implemented in the form of a processing element scheduler code, the processing element may be a general-purpose processor, such as a central processing unit (CentralProcessing Unit, CPU) or other processor that may invoke the program code. For another example, the modules may be integrated together and implemented in the form of a system-on-a-chip (SOC).

Fig. 10 is a schematic structural diagram of a proxy server according to an embodiment of the present invention, as shown in fig. 10, where the proxy server includes: a processor 1001 and a memory 1002. The memory 1002 is used for storing a program, and the processor 1001 calls the program stored in the memory 1002 to execute the above-described method embodiment. The specific implementation manner and the technical effect are similar, and are not repeated here.

Optionally, the present invention also provides a program product, such as a computer readable storage medium, comprising a program for performing the above-described method embodiments when being executed by a processor.

In the several embodiments provided by the present invention, it should be understood that the disclosed apparatus and method may be implemented in other manners. For example, the apparatus embodiments described above are merely illustrative, e.g., the division of the units is merely a logical function division, and there may be additional divisions when actually implemented, e.g., multiple units or components may be combined or integrated into another system, or some features may be omitted or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices or units, which may be in electrical, mechanical or other form.

The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

In addition, each functional unit in the embodiments of the present invention may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in hardware plus software functional units.

The integrated units implemented in the form of software functional units described above may be stored in a computer readable storage medium. The software functional unit is stored in a storage medium, and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) or a processor (english: processor) to perform some of the steps of the methods according to the embodiments of the invention. And the aforementioned storage medium includes: u disk, mobile hard disk, read-Only Memory (ROM), random access Memory (Random Access Memory, RAM), magnetic disk or optical disk, etc.

The above is only a preferred embodiment of the present invention, and is not intended to limit the present invention, but various modifications and variations can be made to the present invention by those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims

1. A method for processing a blockchain user request, applied to a proxy server, comprising:

invoking a blockchain node according to the user processing request after the combination processing so as to enable the blockchain node to process according to the user processing request after the combination processing;

before the block chain node is called according to the user processing request after the merging processing, the method further comprises the following steps:

randomly generating operation identification information;

storing the target object into a to-be-uplink queue;

after the block chain node is called according to the user processing request after the merging processing, the method further comprises:

2. The method of claim 1, wherein the merging the user processing requests received in the preset time period to obtain the merged user processing request includes:

and converging the user processing request received in the preset time period to the to-be-uplink queue to obtain the user processing request after the combination processing.

3. The method according to claim 1, wherein the transmitting, by the target object, the result of the processing success to the first client according to the operation identification information and the first user identification information includes:

4. A method according to claim 3, characterized in that the method further comprises:

deleting user identification document data corresponding to the first user identification information in the user identification cache list, and determining deletion notification information;

5. A method according to claim 3, characterized in that the method further comprises:

6. The method according to claim 1 or 2, characterized in that the method further comprises:

7. The method according to claim 1, wherein the method further comprises:

8. The method of claim 7, wherein querying the local cache according to the second user identification information to obtain a local query result comprises:

9. The method of claim 7, wherein the method further comprises:

and sending the target user identification document data to the second client.

10. The method of claim 8, wherein the method further comprises:

caching the target user identification document data within a preset time length;

11. The method according to claim 1, wherein the method further comprises:

12. The method of claim 1, wherein the user processing request is a user creation request or a user modification request;

13. A blockchain user request processing device, for use with a proxy server, comprising:

the system comprises a receiving module, a processing module and a processing module, wherein the receiving module is used for receiving at least one user processing request sent by a first client, and each user processing request is used for indicating a blockchain node to process first user identification information corresponding to the first client;

the calling module is used for calling the blockchain node according to the user processing request after the combination processing so that the blockchain node can process according to the user processing request after the combination processing;

the apparatus further comprises:

the storage module is used for storing the target object into a to-be-uplink queue;

the apparatus further comprises:

14. A proxy server, comprising: a memory and a processor, the memory storing a computer program executable by the processor, the processor implementing the method of any of the preceding claims 1-12 when the computer program is executed.

15. A storage medium having stored thereon a computer program which, when read and executed, implements the method of any of the preceding claims 1-12.