CN111161072A - Block chain-based random number generation method, equipment and storage medium - Google Patents

Block chain-based random number generation method, equipment and storage medium Download PDF

Info

Publication number
CN111161072A
CN111161072A CN201911396902.0A CN201911396902A CN111161072A CN 111161072 A CN111161072 A CN 111161072A CN 201911396902 A CN201911396902 A CN 201911396902A CN 111161072 A CN111161072 A CN 111161072A
Authority
CN
China
Prior art keywords
random number
timestamp
number generation
generation method
timestamps
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201911396902.0A
Other languages
Chinese (zh)
Inventor
姜明润
肖雪
罗森
李照川
王伟兵
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shandong Inspur Quality Chain Technology Co Ltd
Original Assignee
Shandong ICity Information Technology Co., Ltd.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shandong ICity Information Technology Co., Ltd. filed Critical Shandong ICity Information Technology Co., Ltd.
Priority to CN201911396902.0A priority Critical patent/CN111161072A/en
Publication of CN111161072A publication Critical patent/CN111161072A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q40/00Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/04Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/23Updating
    • G06F16/2308Concurrency control
    • G06F16/2315Optimistic concurrency control
    • G06F16/2322Optimistic concurrency control using timestamps

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • General Physics & Mathematics (AREA)
  • Development Economics (AREA)
  • Technology Law (AREA)
  • Strategic Management (AREA)
  • General Business, Economics & Management (AREA)
  • Marketing (AREA)
  • Economics (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)

Abstract

The application discloses a random number generation method based on a block chain, equipment and a storage medium. The random number generation method comprises the following steps: in response to receiving a request to generate a random number, obtaining a timestamp of the request to generate the random number; based on the timestamp, initiating a transaction request to a smart contract of the blockchain; acquiring a target timestamp based on the timestamp corresponding to the transaction request; and generating a trusted random number according to the target time stamp. By the method and the device, the situation that the reliability of the random numbers cannot be ensured due to too many generated random numbers caused by too many timestamps can be avoided.

Description

Block chain-based random number generation method, equipment and storage medium
Technical Field
The present application relates to the field of computer technologies, and in particular, to a block chain-based random number generation method, device, and storage medium.
Background
The super ledger of the blockchain is distributed, and when each node of the blockchain receives a request for generating a random number, the parameter-time stamp for locally executing random number generation may be different due to network delay and the like. Even if the time stamps of the requests differ by several milliseconds, the finally generated hash values are greatly different, and finally, the node initiating the generation of the random number receives various random numbers sent by other nodes, and the node cannot acquire the random number with higher reliability from the various random numbers.
Disclosure of Invention
An embodiment of the present specification provides a block chain-based random number generation method, device, and storage medium, which are used to solve the following technical problems in the prior art: how to obtain random numbers with higher reliability.
The embodiment of the specification adopts the following technical scheme:
according to a first aspect, an embodiment of the present invention provides a block chain-based random number generation method, including: in response to receiving a request to generate a random number, obtaining a timestamp of the request to generate the random number; based on the timestamp, initiating a transaction request to a smart contract of the blockchain; acquiring a target timestamp based on the timestamp corresponding to the transaction request; and generating a trusted random number according to the target time stamp.
In a preferred implementation, obtaining the target timestamp based on the timestamp corresponding to the transaction request includes: ordering the transaction requests according to the corresponding timestamps thereof through the intelligent contracts; and acquiring a target timestamp according to the sequenced transaction requests and the timestamps corresponding to the transaction requests.
In a preferred implementation, obtaining the target timestamp based on the timestamp corresponding to the transaction request includes: removing the maximum value and the minimum value in the time stamp to obtain a residual time stamp; and acquiring the target timestamp from the residual timestamps.
In a preferred implementation, obtaining the target timestamp from the remaining timestamps includes: an average value of the remaining time stamps is obtained, and the average value is taken as a target time stamp.
In a preferred implementation, obtaining the target timestamp from the remaining timestamps includes: and acquiring a mode time stamp in the residual time stamps, and taking the mode time stamp as a target time stamp.
In a preferred implementation, obtaining the target timestamp from the remaining timestamps includes: and acquiring a median of the residual timestamps, and taking the median as the target timestamp.
In a preferred implementation, the trusted random number is a predetermined number of bits of random number.
In a preferred implementation, the trusted nonce comprises at least one of: letters, numbers.
According to a second aspect, an embodiment of the present invention provides a block chain-based random number generation device, including: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of block chain based random number generation of the first aspect or any implementation of the first aspect.
According to a third aspect, an embodiment of the present invention provides a non-volatile computer storage medium for block chain-based random number generation, which stores computer-executable instructions that, when executed, may implement the block chain-based random number generation method according to the first aspect or any implementation manner of the first aspect.
The embodiment of the specification adopts at least one technical scheme which can achieve the following beneficial effects: if a request for generating the random number is received, a time stamp for generating the random number request is firstly obtained, then a transaction request is initiated to the intelligent contract of the block chain based on the time stamp, then a target time stamp is obtained based on the time stamp corresponding to the transaction request, and the credible random number is generated according to the target time stamp. The target timestamp is acquired first and then the trusted random number is generated, so that the problem that the reliability of the random number cannot be ensured due to too many generated random numbers caused by too many timestamps is avoided.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the application and together with the description serve to explain the application and not to limit the application. In the drawings:
FIG. 1 is a block diagram of an exemplary system architecture to which an embodiment of a blockchain-based random number generation method of the present application is applied;
FIG. 2 is a flow diagram for one embodiment of a block chain based random number generation method according to the present application;
FIG. 3 is a flow diagram of one implementation of a block chain based random number generation method according to the present application;
fig. 4 is a schematic structural diagram of a block chain-based random number generation apparatus suitable for implementing an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present disclosure more apparent, the technical solutions of the present disclosure will be clearly and completely described below with reference to the specific embodiments of the present disclosure and the accompanying drawings. It should be apparent that the described embodiments are only some of the embodiments of the present application, and not all of the embodiments. All other embodiments obtained by a person skilled in the art without making any inventive step based on the embodiments in the description belong to the protection scope of the present application.
The technical solutions provided by the embodiments of the present application are described in detail below with reference to the accompanying drawings.
Fig. 1 illustrates an exemplary architecture 100 to which an embodiment of the blockchain-based random number generation method of the present application may be applied.
As shown in fig. 1, the system architecture 100 may include terminal devices 101, 102, 103, a network 104, and a server 105. The network 104 serves as a medium for providing communication links between the terminal devices 101, 102, 103 and the server 105. Network 104 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.
The terminal devices 101, 102, 103 interact with a server 105 via a network 104 to receive or send messages or the like. The terminal devices 101, 102, 103 may have various communication client applications installed thereon, such as a web browser application, a video application, an instant messenger, a mailbox client, a traffic information application, a reading application, and the like.
The terminal apparatuses 101, 102, and 103 may be hardware or software. When the terminal apparatuses 101, 102, 103 are hardware, various electronic apparatuses having a display screen and supporting communication with a server may be used. When the terminal apparatuses 101, 102, and 103 are software, they may be software clients installed in the electronic apparatuses. It may be implemented as multiple pieces of software or software modules (e.g., software or software modules used to provide distributed services) or as a single piece of software or software module. And is not particularly limited herein.
The server 105 may be a server providing various services, such as a background server providing support for browsing pages on the terminal devices 101, 102, 103. The background server can analyze and process the acquired request for generating the random number, and feed back the information processing result to the terminal equipment.
The server may be hardware or software. When the server is hardware, it may be implemented as a distributed server cluster formed by multiple servers, or may be implemented as a single server. When the server is software, it may be implemented as multiple pieces of software or software modules (e.g., software or software modules used to provide distributed services), or as a single piece of software or software module. And is not particularly limited herein.
It should be noted that the block chain based random number generation method provided by the embodiment of the present disclosure is generally executed by a server, and accordingly, a random number generation apparatus for block chain based is generally disposed in the server.
It should be understood that the number of terminal devices, networks, and servers in fig. 1 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
With continued reference to fig. 2, a flow 200 of one embodiment of a blockchain-based random number generation method according to the present application is shown. The random number generation method based on the block chain is applied to a server. As shown in fig. 2, the block chain-based random number generation method includes the following steps:
step 201, in response to receiving a random number generation request, obtaining a timestamp of the random number generation request.
In this embodiment, if a random number generation request is received, an execution subject (e.g., the server 105 shown in fig. 1) executing the random number generation method based on the block chain may obtain a timestamp of the random number generation request.
Specifically, generated random number requests are sent to nodes of the blockchain, each including a timestamp, and thus the timestamp of the generated random number request is obtained.
Based on the timestamp, a transaction request is initiated to the smart contract of the blockchain, step 202.
In this embodiment, if the timestamp of the request for generating the random number is obtained, the execution main body may initiate a transaction request to the smart contract of the blockchain.
In particular, a transaction request is understood herein to mean a request that characterizes the need for an intelligent contract to process the aforementioned timestamp of the request for generating a random number. Intelligent contracts are usually already pre-arranged in the nodes of the blockchain.
Step 203, obtaining a target timestamp based on the timestamp corresponding to the transaction request.
In particular, the transaction request may also correspond to a time stamp. Because there may be a plurality of random number generation requests, the timestamps of the random number generation requests may be in the same order as the timestamps corresponding to the transaction requests according to the time sequencing order, and as many random number generation requests as there are, there are as many transaction requests as there are, and as many timestamps as there are, the target timestamp is obtained from the timestamps corresponding to the transaction requests.
In an optional implementation manner of this embodiment, as shown in fig. 3, the execution main body may obtain the target timestamp by:
step 301, the transaction requests are sequenced according to the corresponding time stamp sequence through the intelligent contract.
Step 302, obtain a target timestamp according to the sorted transaction requests and their corresponding timestamps.
Because the time for generating each transaction request may not be all the same, if a random number is generated correspondingly to the timestamp of each transaction request, the number of random numbers generated finally is too large, and for the node, it is impossible to determine which random number has high reliability and how to select the random number, so that the transaction requests can be sorted according to the corresponding timestamp sequence, and then the target timestamp can be obtained from the sorted transaction requests and the corresponding timestamps.
In this embodiment, the execution body may remove the maximum value and the minimum value in the time stamp to obtain the remaining time stamp. Since each transaction request corresponds to a timestamp, the maximum and minimum of these timestamps may be removed, and then the target timestamp may be retrieved from the remaining timestamps.
Specifically, the execution main body may acquire an average value of the remaining time stamps, and take the average value as the target time stamp. Alternatively, the execution main unit may acquire a mode timestamp in the remaining timestamps and use the mode timestamp as the target timestamp, or the execution main unit may acquire a median of the remaining timestamps and use the median as the target timestamp. The averaging algorithm is to sum the timestamps to obtain a sum, and then divide the sum by the number of remaining timestamps to obtain an average of the remaining timestamps. The mode timestamp is the timestamp with the largest occurrence number in the remaining timestamps. And if the residual timestamps are even numbers, the average value of the two timestamps arranged at the middlest is obtained, so that the target timestamp is obtained.
And step 204, generating a trusted random number according to the target timestamp.
In this embodiment, if the target timestamp is obtained, the execution main body may generate the trusted random number according to the target timestamp.
Specifically, the authentic random number is a random number of a predetermined number of bits. For example, the number of bits may be four or ten, and this embodiment is not limited thereto. The trusted random number may include, but is not limited to, letters, numbers, and the like, and the present embodiment is not limited thereto.
According to the random number generation method based on the block chain, if a random number generation request is received, a timestamp for generating the random number request is obtained first, then a transaction request is initiated to an intelligent contract of the block chain based on the timestamp, then a target timestamp is obtained based on the timestamp corresponding to the transaction request, and a credible random number is generated according to the target timestamp. The target timestamp is acquired first and then the trusted random number is generated, so that the problem that the reliability of the random number cannot be ensured due to too many generated random numbers caused by too many timestamps is avoided.
Referring now to fig. 4, and referring now to fig. 4, a block chain-based random number generation apparatus (e.g., the server of fig. 1) 400 is shown in a schematic diagram form that is suitable for use in implementing embodiments of the present disclosure. The processing device shown in fig. 4 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present disclosure.
As shown in fig. 4, processing device 400 may include a processing means (e.g., central processing unit, graphics processor, etc.) 401 that may perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)402 or a program loaded from a storage means 408 into a Random Access Memory (RAM) 403. In the RAM403, various programs and data necessary for the operation of the electronic apparatus 400 are also stored. The processing device 401, the ROM402, and the RAM403 are connected to each other via a bus 404. An input/output (I/O) interface 405 is also connected to bus 404.
Generally, the following devices may be connected to the I/O interface 405: input devices 406 including, for example, a touch screen, touch pad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; an output device 407 including, for example, a Liquid Crystal Display (LCD), a speaker, a vibrator, or the like; storage 408 including, for example, tape, hard disk, etc.; and a communication device 409. The communication means 409 may allow the electronic device 400 to communicate wirelessly or by wire with other devices to exchange data. While fig. 4 illustrates an electronic device 400 having various means, it is to be understood that not all illustrated means are required to be implemented or provided. More or fewer devices may alternatively be implemented or provided. Each block shown in fig. 4 may represent one device or may represent multiple devices as desired.
In particular, according to an embodiment of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network via the communication device 409, or from the storage device 408, or from the ROM 402. The computer program, when executed by the processing apparatus 401, performs the above-described functions defined in the methods of embodiments of the present disclosure.
It should be noted that the computer readable medium described in the embodiments of the present disclosure may be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
In embodiments of the disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In embodiments of the present disclosure, however, a computer readable signal medium may comprise a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, optical cables, RF (Radio Frequency), etc., or any suitable combination of the foregoing.
The computer readable medium may be embodied in the electronic device; or may exist separately and not be assembled into the server. The computer readable medium carries one or more programs which, when executed by the server, cause the server to: in response to receiving a request to generate a random number, obtaining a timestamp of the request to generate the random number; based on the time stamp, initiating a transaction request to an intelligent contract of the blockchain; acquiring a target timestamp based on the timestamp corresponding to the transaction request; and generating a trusted random number according to the target time stamp.
Computer program code for carrying out operations for embodiments of the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C + +, and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
The foregoing description is only exemplary of the preferred embodiments of the disclosure and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the invention in the embodiments of the present disclosure is not limited to the specific combination of the above-mentioned features, but also encompasses other embodiments in which any combination of the above-mentioned features or their equivalents is made without departing from the inventive concept as defined above. For example, the above features and (but not limited to) technical features with similar functions disclosed in the embodiments of the present disclosure are mutually replaced to form the technical solution.

Claims (10)

1. A block chain-based random number generation method is characterized by comprising the following steps:
in response to receiving a request to generate a random number, obtaining a timestamp of the request to generate the random number;
based on the time stamp, initiating a transaction request to a smart contract of a blockchain;
acquiring a target timestamp based on the timestamp corresponding to the transaction request;
and generating a trusted random number according to the target timestamp.
2. The random number generation method of claim 1, wherein obtaining a target timestamp based on the timestamp corresponding to the transaction request comprises:
sequencing the transaction requests according to the corresponding timestamps thereof through the intelligent contracts;
and acquiring a target timestamp according to the sequenced transaction requests and the timestamps corresponding to the transaction requests.
3. The random number generation method of claim 2, wherein obtaining a target timestamp based on the timestamp corresponding to the transaction request comprises:
removing the maximum value and the minimum value in the time stamp to obtain a residual time stamp;
and acquiring a target timestamp from the residual timestamps.
4. The random number generation method according to claim 3, wherein said obtaining a target timestamp from the remaining timestamps includes:
and acquiring the average value of the residual timestamps, and taking the average value as the target timestamp.
5. The random number generation method according to claim 3, wherein said obtaining a target timestamp from the remaining timestamps includes:
and acquiring a mode time stamp in the residual time stamps, and taking the mode time stamp as the target time stamp.
6. The random number generation method according to claim 3, wherein said obtaining a target timestamp from the remaining timestamps includes:
and acquiring a median of the residual timestamps, and taking the median as the target timestamp.
7. The random number generation method according to any one of claims 1 to 6, wherein the authentic random number is a random number of a predetermined number of bits.
8. The random number generation method of any of claims 1-6, wherein the trusted random number comprises at least one of: letters, numbers.
9. A block chain-based random number generation device, comprising:
at least one processor; and the number of the first and second groups,
a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the block chain based random number generation method of any one of claims 1-8.
10. A non-transitory computer storage medium storing computer-executable instructions for random number generation based on blockchains, wherein the computer-executable instructions, when executed, implement the method for random number generation based on blockchains of any one of claims 1 to 8.
CN201911396902.0A 2019-12-30 2019-12-30 Block chain-based random number generation method, equipment and storage medium Pending CN111161072A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911396902.0A CN111161072A (en) 2019-12-30 2019-12-30 Block chain-based random number generation method, equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911396902.0A CN111161072A (en) 2019-12-30 2019-12-30 Block chain-based random number generation method, equipment and storage medium

Publications (1)

Publication Number Publication Date
CN111161072A true CN111161072A (en) 2020-05-15

Family

ID=70559294

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911396902.0A Pending CN111161072A (en) 2019-12-30 2019-12-30 Block chain-based random number generation method, equipment and storage medium

Country Status (1)

Country Link
CN (1) CN111161072A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111708538A (en) * 2020-05-29 2020-09-25 平安医疗健康管理股份有限公司 Transaction circulation method, device, computer equipment and computer readable storage medium
CN113612864A (en) * 2021-07-16 2021-11-05 济南浪潮数据技术有限公司 Method, system, equipment and medium for generating IPv6 address

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111708538A (en) * 2020-05-29 2020-09-25 平安医疗健康管理股份有限公司 Transaction circulation method, device, computer equipment and computer readable storage medium
CN111708538B (en) * 2020-05-29 2022-03-22 平安医疗健康管理股份有限公司 Transaction circulation method, device, computer equipment and computer readable storage medium
CN113612864A (en) * 2021-07-16 2021-11-05 济南浪潮数据技术有限公司 Method, system, equipment and medium for generating IPv6 address
CN113612864B (en) * 2021-07-16 2023-09-26 济南浪潮数据技术有限公司 Method, system, equipment and medium for generating IPv6 address

Similar Documents

Publication Publication Date Title
CN111158637A (en) Block chain-based random number generation method, equipment and storage medium
CN110909521B (en) Online document information synchronous processing method and device and electronic equipment
CN110391938B (en) Method and apparatus for deploying services
CN110377440B (en) Information processing method and device
CN111338834B (en) Data storage method and device
CN113722055A (en) Data processing method and device, electronic equipment and computer readable medium
CN111161072A (en) Block chain-based random number generation method, equipment and storage medium
CN108764866B (en) Method and equipment for allocating resources and drawing resources
WO2024066374A1 (en) Service degradation method and apparatus, device, computer-readable medium and program product
CN110795328A (en) Interface testing method and device
CN111984615A (en) Method, device and system for sharing files
CN111078715A (en) Synchronous storage method and device for internet advertisement data on block chain
CN113420400B (en) Routing relation establishment method, request processing method, device and equipment
CN113553206B (en) Data event execution method and device, electronic equipment and computer readable medium
CN111198853A (en) Data processing method and device, electronic equipment and computer readable storage medium
CN112346661B (en) Data processing method and device and electronic equipment
CN114115941A (en) Resource sending method, page rendering method, device, electronic equipment and medium
CN114035861A (en) Cluster configuration method and device, electronic equipment and computer readable medium
CN111163156A (en) Data processing method, device and storage medium based on block chain
CN111367592B (en) Information processing method and device
CN113472565B (en) Method, apparatus, device and computer readable medium for expanding server function
CN111835846B (en) Information updating method and device and electronic equipment
CN110262756B (en) Method and device for caching data
CN112311833B (en) Data updating method and device
CN116319322B (en) Power equipment node communication connection method, device, equipment and computer medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
TA01 Transfer of patent application right
TA01 Transfer of patent application right

Effective date of registration: 20200814

Address after: Room 1-2301, Building 7, North District, Shandong Design and Creative Industry Park, No. 868 Tangye West Road, Licheng District, Jinan City, Shandong Province, 250102

Applicant after: SHANDONG INSPUR QUALINK TECHNOLOGY Co.,Ltd.

Address before: Room 3110, S01 building, Langchao building, No. 1036, Langchao Road, high tech Zone, Jinan City, Shandong Province 250101

Applicant before: Shandong Aicheng Network Information Technology Co.,Ltd.

SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination