CN113504978A

CN113504978A - Method, apparatus and readable storage medium for determining out-of-block time of block chain

Info

Publication number: CN113504978A
Application number: CN202110795642.5A
Authority: CN
Inventors: 史锋锋
Original assignee: Jiaxing Jiahe Blockchain Technology Research Institute; Jiaxing Nanhu Red Chain Technology Co ltd; Shanghai Daokuai Information Technology Co Ltd; Shanghai Dianrong Information Technology Co ltd
Current assignee: Jiaxing Jiahe Blockchain Technology Research Institute; Jiaxing Nanhu Red Chain Technology Co ltd; Shanghai Daokuai Information Technology Co Ltd; Shanghai Dianrong Information Technology Co ltd
Priority date: 2021-07-14
Filing date: 2021-07-14
Publication date: 2021-10-15

Abstract

The present disclosure provides a method for determining an out-of-block time in a blockchain, the method comprising: acquiring a blockchain transaction request, wherein the blockchain transaction request comprises service quality information related to the priority of the blockchain transaction request and a maximum transaction quantity; determining the maximum block-out waiting time according to the service quality information included in the block chain transaction request; and determining an actual block out time based on the maximum block out wait time and the maximum transaction amount. The blockchain transaction request comprises the service quality information related to the priority of the blockchain transaction request, so that the technical scheme provided by the disclosure can meet the requirements of services or clients with different priorities, the corresponding speed of the blockchain is increased, and the user experience satisfaction is improved.

Description

Method, apparatus and readable storage medium for determining out-of-block time of block chain

Technical Field

The present disclosure relates to a block chain technology, and more particularly, to a method for determining an out-of-block time in a block chain, an apparatus for determining an out-of-block time in a block chain, and a readable storage medium.

Background

In a federation chain network, a blockchain algorithm usually does not consider malicious nodes, and all nodes participate in the consensus process of the blockchain algorithm. The block-out process of the consensus algorithm is to pack the transaction into blocks, calculate the hash of the blocks and form a block chain account book which cannot be tampered. The block packing algorithm in the prior art has two constraint variables, one is the maximum transaction number in a block, the other is the block packing maximum waiting time, and if the condition is reached first, a block is obtained. For example, the maximum transaction amount in a block is 10, the block packing longest waiting time is 2 seconds, and if the transaction amount received by the consensus node exceeds 10 or the waiting time exceeds 2 seconds, the consensus node packs a block. After the transaction is packed into the block, the transaction can be considered to be finally successful only by obtaining the verification and confirmation of the transaction node. Therefore, a transaction proposal is submitted to the transaction node, then the transaction is sent to the common identification node to go out of the block until the transaction node receives the block and successfully verifies the block, and the whole process is a complete execution process of the transaction. The service system generally calls the blockchain transaction node and the consensus node through the blockchain application gateway, or the service system can directly call the blockchain transaction node and the consensus node.

In the real world, some blockchain transactions usually have higher priority, and it is necessary to minimize the delay time during their writing into the blockchain. For example, when a blockchain network provides service to the outside, according to the service level or priority of a user, for the user with high service level and high priority, the transaction provides higher response level when the user gets out of a block, but in the blockchain network, due to the implementation mechanism of a block policy by a consensus algorithm, all transactions can be treated fairly, and according to the block-out policy with the maximum transaction quantity and the longest waiting time, the transaction with high priority cannot be packaged into a block in time, so that the response level is influenced.

Disclosure of Invention

In order to address the requirement of different users or services for the response time of a block chain, an embodiment of the present invention provides a method for determining an out-of-block time in a block chain, where the method includes:

acquiring a blockchain transaction request, wherein the blockchain transaction request comprises service quality information related to the priority of the blockchain transaction request and a maximum transaction quantity;

determining the maximum block-out waiting time according to the service quality information included in the block chain transaction request; and

determining an actual block out time based on the maximum block out wait time and the maximum transaction amount.

In one embodiment according to the present disclosure, the quality of service information includes:

a priority number associated with a service priority;

a service response level associated with a quality of service; or

The block latency is longest.

In one embodiment according to the present disclosure, the priority number is within a predetermined threshold range.

In an embodiment according to the present disclosure, determining a maximum out-of-block waiting time according to the quality of service information included in the blockchain transaction request further includes:

determining a maximum out-of-block waiting time based on a predetermined first correspondence table and the priority level number associated with the service priority; or

And determining the maximum block-out waiting time according to the service response grade associated with the service quality and the priority grade number associated with the service priority based on a predetermined linear equation.

In one embodiment consistent with the present disclosure, the service response levels include a high level service response level, a medium level service response level, and/or a low level service response level.

determining a maximum out-of-block latency based on a predetermined second correspondence table and the service response level.

Furthermore, a second aspect of the present disclosure also proposes an apparatus for determining a block out time in a block chain, wherein the apparatus comprises:

a processor; and

a memory for storing instructions that, when executed, cause the processor to:

a priority number associated with a service priority;

a service response level associated with a quality of service; or

The block latency is longest.

Furthermore, a third aspect of the present disclosure also proposes a computer-readable storage medium having stored thereon computer-readable program instructions for executing the method for determining an out-of-block time in a blockchain proposed according to the first aspect of the present disclosure.

In summary, since the blockchain transaction request includes the service quality information related to the priority of the blockchain transaction request, the technical solution provided by the present disclosure can meet the requirements of services or clients with different priorities, thereby increasing the corresponding speed of the blockchain and improving the satisfaction of user experience. Other advantages of the present invention will be further described below.

Drawings

The features, advantages and other aspects of various embodiments of the present invention will become more apparent by referring to the following detailed description in conjunction with the accompanying drawings, in which several embodiments of the invention are shown by way of illustration and not limitation, wherein:

fig. 1 shows a flow chart of a method 100 for determining an out-of-block time in a blockchain proposed in accordance with the present disclosure;

fig. 2 shows a schematic diagram of an embodiment 200 of a network architecture in which the method 100 for determining an out-of-block time in a blockchain according to fig. 1 can be implemented;

fig. 3 shows a schematic diagram of an apparatus 300 for determining a block out time in a block chain according to an embodiment of the invention; and

fig. 4 shows a schematic diagram of an apparatus 400 for determining a block out time in a block chain according to another embodiment of the invention.

Detailed Description

Various exemplary embodiments of the present invention are described in detail below with reference to the accompanying drawings. Although the exemplary methods, apparatus, and devices described below include software and/or firmware executed on hardware among other components, it should be noted that these examples are merely illustrative and should not be considered as limiting. For example, it is contemplated that any or all of the hardware, software, and firmware components could be embodied exclusively in hardware, exclusively in software, or in any combination of hardware and software. Thus, while the following describes example methods and apparatus, persons of ordinary skill in the art will readily appreciate that the examples provided are not intended to limit the manner in which the methods and apparatus may be implemented.

Furthermore, the flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of methods and systems according to various embodiments of the present invention. It should be noted that the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

In order to solve the requirement of different users or services on the response time of the blockchain, an embodiment of the present invention provides a method for determining an out-of-block time in the blockchain, fig. 1 shows a flowchart of a method 100 for determining an out-of-block time in a blockchain according to the present disclosure, and as can be seen from fig. 1, the method 100 at least includes the following three steps:

first, in method step 110, a blockchain transaction request is obtained, wherein the blockchain transaction request includes quality of service information and a maximum transaction amount related to a priority of the blockchain transaction request;

then, in method step 120, a maximum out-of-block waiting time is determined according to the quality of service information included in the blockchain transaction request; and

finally, in a method step 130, an actual block out time is determined based on the maximum block out wait time and the maximum transaction amount.

In one embodiment according to the present disclosure, the quality of service information includes: a priority number associated with a service priority; a service response level associated with a quality of service; or at most block latency.

Preferably, in one embodiment according to the present disclosure, the priority number is within a predetermined threshold range. At this time, for example, in one embodiment according to the present disclosure, the determining a maximum out-of-block waiting time according to the quality of service information included in the blockchain transaction request further includes: determining a maximum out-of-block waiting time based on a predetermined first correspondence table and the priority level number associated with the service priority; or determining the maximum block-out waiting time according to the service response level associated with the service quality and the priority level number associated with the service priority based on a predetermined linear equation.

For example, when a service system or a blockchain application gateway submits a transaction to a consensus node, a quality of service tag may be carried in the transaction, and the quality of service tag may have the following forms:

high to low priority P1-P2, where P1, P2 are numbers, such as 1-10, arranged from low to high priority.

The service quality is classified from high to low { C1, C2, C3 … }, where C1 may be a number, a byte code, or a string of characters, such as H, M, L, representing high, medium, low service quality.

The quality of service is the transaction out block maximum latency T1.

For the above qos tags, a fixed qos tag may be attached to the transaction, or a range of qos tags, such as the lowest and highest qos tags, may be attached. If not, the consensus node may default to a certain predefined quality of service level.

Preferably or alternatively, in one embodiment according to the present disclosure, the service response levels include a high level service response level, a medium level service response level, and/or a low level service response level. At this time, preferably, in an embodiment according to the present disclosure, the determining a maximum out-of-block waiting time according to the quality of service information included in the blockchain transaction request further includes: determining a maximum out-of-block latency based on a predetermined second correspondence table and the service response level.

For example, the common node determines the common block time according to the maximum waiting time of the common block corresponding to the predefined quality of service. The method for calculating the fast maximum waiting time according to different types of service quality labels is as follows: for the service quality labels of the types from high priority to low priority, two methods are used for calculating the longest block waiting time, the first method is in the form of a relation table, { P1, T1} { P2, T2} { P3, T3} … … { Pn, Tn }, and the longest block waiting time is directly obtained according to the corresponding relation of the corresponding priority. The second is a calculation formula, where T ═ Pn × W + Q has a priority of 10 "1 from high to low, W is a preconfigured weight (W ═ 0.1), Q is a preconfigured adjustment factor (Q ═ 1.1), and the waiting time with a priority of 10 is: t10 (-0.1) +1.1 0.1 seconds, the latency with priority 1 is: t ═ 1 × (-0.1) +1.1 ═ 1 second, this formula is only one calculation method, there may be other calculation methods as well, and the calculation method is a part of the formula node blocking strategy. For the class quality labels with the service quality from high to low, the longest block waiting time can be directly obtained according to the corresponding relation of the corresponding quality classes according to the form of a predefined relation table, { C1, T1} { C2, T2} { C3, T3} … … { Cn, Tn }.

And for the quality label with the service quality of the transaction out-block waiting time, directly obtaining the longest out-block waiting time, and if the out-block waiting time is not in the out-block waiting time range defined by the consensus node, the consensus node can consider the service quality label to be invalid and process the label according to the default service quality level. And under the condition that the service quality labels carried in the transaction are in the range, respectively calculating the block-out time corresponding to the highest and lowest service quality labels by the consensus node, and then determining the optimal block-out waiting time by the consensus node in the time range. And providing the time of the transaction block according with the service quality on the consensus node according to the service quality information carried by the transaction.

Fig. 2 shows a schematic diagram of an embodiment 200 of a network architecture in which the method 100 for determining an out-of-block time in a block chain according to fig. 1 can be implemented, and it can be seen from fig. 2 that a consensus node packs a block. After the transaction is packed into the block, the transaction can be considered to be finally successful only by obtaining the verification and confirmation of the transaction node. Therefore, a transaction proposal is submitted to the transaction node, then the transaction is sent to the common identification node to go out of the block until the transaction node receives the block and successfully verifies the block, and the whole process is a complete execution process of the transaction. The service system generally calls the blockchain transaction node and the consensus node through the blockchain application gateway, or the service system can directly call the blockchain transaction node and the consensus node.

Further, alternatively, the above-described method can be implemented by a computer program product, i.e., a computer-readable storage medium. The computer program product may include a computer-readable storage medium having computer-readable program instructions embodied thereon for carrying out various aspects of the present disclosure. The computer readable storage medium may be a tangible device that can hold and store the instructions for use by the instruction execution device. The computer readable storage medium may be, for example, but not limited to, an electronic memory device, a magnetic memory device, an optical memory device, an electromagnetic memory device, a semiconductor memory device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: 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), a Static Random Access Memory (SRAM), a portable compact disc read-only memory (CD-ROM), a Digital Versatile Disc (DVD), a memory stick, a floppy disk, a mechanical coding device, such as punch cards or in-groove projection structures having instructions stored thereon, and any suitable combination of the foregoing. Computer-readable storage media as used herein is not to be construed as transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission medium (e.g., optical pulses through a fiber optic cable), or electrical signals transmitted through electrical wires.

Fig. 3 shows a schematic diagram of an apparatus 300 for determining a block out time in a block chain according to an embodiment of the invention. As can be seen in FIG. 3, the blockchain based secure multi-party computing device 300 includes a processor 310 and a memory 320 coupled to the processor 310.

The memory 320 stores instructions. The instructions, when executed by the processor 310, cause the processor 310 to perform the following acts:

a priority number associated with a service priority;

a service response level associated with a quality of service; or

The block latency is longest.

Fig. 4 shows a schematic diagram of an apparatus 400 for determining a block out time in a block chain according to another embodiment of the invention. It should be appreciated that the apparatus 400 may be implemented to implement the functionality of the method 100 of fig. 1 for determining an out-of-block time in a blockchain. It can be seen from fig. 4 that the blockchain based secure multi-party computing device 400 includes a Central Processing Unit (CPU)401, e.g., a processor, which may perform various appropriate actions and processes according to computer program instructions stored in a Read Only Memory (ROM)402 or loaded from a storage unit 408 into a Random Access Memory (RAM) 403. In the RAM 403, various programs and data necessary for the operation of the apparatus 400 can also be stored. The CPU 401, ROM 402, and RAM 403 are connected to each other via a bus 404. An input/output (I/O) interface 405 is also connected to bus 404.

A number of components in the apparatus 400 are connected to the I/O interface 405, including: an input unit 406 such as a keyboard, a mouse, or the like; an output unit 407 such as various types of displays, speakers, and the like; a storage unit 408 such as a magnetic disk, optical disk, or the like; and a communication unit 409 such as a network card, modem, wireless communication transceiver, etc. The communication unit 409 allows the apparatus 400 to exchange information/data with other devices via a computer network such as the internet and/or various telecommunication networks.

Various methods described above, such as a block chain based secure multi-party computing method, can be performed by processing unit 401. For example, in some embodiments, the method 100 for determining a block out time in a blockchain may be implemented as a computer software program tangibly embodied in a machine-readable medium, such as the storage unit 408. In some embodiments, part or all of the computer program may be loaded and/or installed onto the apparatus 400 via the ROM 402 and/or the communication unit 409. When loaded into RAM 403 and executed by CPU 401, may perform one or more of the acts or steps described above in method 100 of determining out-of-block times in a blockchain.

In general, the various exemplary embodiments of this invention may be implemented in hardware or special purpose circuits, software, firmware, logic or any combination thereof. Certain aspects may be implemented in hardware, while other aspects may be implemented in firmware or software which may be executed by a controller, microprocessor or other computing device. While various aspects of the embodiments of the invention may be illustrated and described as block diagrams, flow charts, or using some other pictorial representation, it is well understood that the blocks, apparatus, systems, techniques or methods described herein may be implemented in, as non-limiting examples, hardware, software, firmware, special purpose circuits or logic, general purpose hardware or controller or other computing devices, or some combination thereof.

Although the various exemplary embodiments of the present invention are described above as being implemented in hardware or in dedicated circuitry, the data processing apparatus for blockchains described above may be implemented in either hardware or software, because: in the 90's of the 20 th century, a technological improvement could easily be either a hardware improvement (e.g., an improvement in the structure of a circuit such as a diode, a transistor, a switch, etc.) or a software improvement (e.g., an improvement in the process flow). However, as the technology continues to develop, many of the current method flow improvements can be almost realized by programming the improved method flow into the hardware circuit, in other words, by programming different programs for the hardware circuit to obtain the corresponding hardware circuit structure, i.e. realizing the change of the hardware circuit structure, so that such method flow improvements can also be regarded as direct improvements of the hardware circuit structure. Thus, it cannot be said that an improvement in the process flow cannot be realized by hardware physical modules. For example, a Programmable Logic Device (PLD), such as a Field Programmable Gate Array (FPGA), is an integrated circuit whose Logic functions are determined by a user programming the Device. A digital system is "integrated" on a piece of programmable logic device by the designer's own programming without requiring the chip manufacturer to design and fabricate application specific integrated circuit chips. Furthermore, nowadays, instead of manually making an Integrated Circuit chip, such Programming is often implemented by "logic compiler 1 er" software, which is similar to a software compiler used in program development and writing, but the original code before compiling is also written by a specific Programming Language, which is called Hardware Description Language (HDL), and HDL is not only one kind, but many kinds, such as abel (advanced Boolean Expression Language), ahdl (advanced Hardware Description Language), communication, pl (core unity Programming Language), HDCal, JHDL (Java Hardware Description Language), Lava, Lola, HDL, pamm, hard Language (Hardware Description Language), and vhigh Language (Hardware Description Language), which are currently used in the most popular fields. It will also be apparent to those skilled in the art that hardware circuitry that implements the logical method flows can be readily obtained by merely slightly programming the method flows into an integrated circuit using the hardware description languages described above.

Computer readable program instructions or computer program products for performing aspects of the present disclosure can also be stored in the cloud, and when a call is needed, a user can access the computer readable program instructions stored in the cloud for performing aspects of the present disclosure through a mobile internet, a fixed network, or other networks, so as to implement the technical solutions disclosed according to aspects of the present disclosure.

In summary, since the blockchain transaction request includes the service quality information related to the priority of the blockchain transaction request, the technical solution provided by the present disclosure can meet the requirements of services or clients with different priorities, thereby increasing the corresponding speed of the blockchain and improving the satisfaction of user experience.

The above description is only an alternative embodiment of the present disclosure, and is not intended to limit the embodiments of the present disclosure, and various modifications and changes may be made to the embodiments of the present disclosure by those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the embodiments of the present invention should be included in the protection scope of the embodiments of the present invention.

While embodiments of the invention have been described with reference to several particular embodiments, it is to be understood that embodiments of the invention are not limited to the specific embodiments disclosed. The embodiments of the invention are intended to cover various modifications and equivalent arrangements included within the spirit and scope of the appended claims. The scope of the claims is to be accorded the broadest interpretation so as to encompass all such modifications and equivalent structures and functions.

Claims

1. A method for determining an out-of-block time in a block chain, the method comprising:

2. The method of claim 1, wherein the quality of service information comprises:

a priority number associated with a service priority;

a service response level associated with a quality of service; or

The block latency is longest.

3. The method of claim 2, wherein the priority number is within a predetermined threshold.

4. The method of claim 3, wherein determining a maximum out-of-block latency time based on the quality of service information included in the blockchain transaction request further comprises:

5. The method of claim 2, wherein the service response level comprises a high level service response level, a medium level service response level, and/or a low level service response level.

6. The method of claim 5, wherein determining a maximum out-of-block latency time based on the quality of service information included in the blockchain transaction request further comprises:

7. An apparatus for determining an out-of-block time in a block chain, the apparatus comprising:

a processor; and

a memory for storing instructions that, when executed, cause the processor to:

8. The apparatus of claim 7, wherein the quality of service information comprises:

a priority number associated with a service priority;

a service response level associated with a quality of service; or

The block latency is longest.

9. The apparatus of claim 8, wherein the priority number is within a predetermined threshold.

10. The apparatus of claim 9, wherein determining a maximum out-of-block latency time based on the quality of service information included in the blockchain transaction request further comprises:

11. The apparatus of claim 8, wherein the service response levels comprise a high level service response level, a medium level service response level, and/or a low level service response level.

12. The apparatus of claim 11, wherein determining a maximum out-of-block latency time based on the quality of service information included in the blockchain transaction request further comprises:

13. A computer readable storage medium having stored thereon computer readable program instructions for performing the method for determining a block out time in a blockchain according to any one of claims 1 to 6.