A decentralized service supervision method and device

Abstract

The present invention provides a decentralized service supervision method and device, which receives reward and punishment information uploaded by each entity end, wherein the reward and punishment information corresponds to the service quality of the entity end; according to the equity proof consensus, the reward and punishment information uploaded by each entity end is linked and stored; based on the smart contract and the reward and punishment information, a technical solution is used to obtain the execution result of each entity end, and the entity ends are connected to form a blockchain system that communicates with each other, wherein each entity end serves as a node of the blockchain system. For management, the reward and punishment information of each entity end is linked and stored, and the equity proof consensus mechanism is used during storage, so that the reward information is stored in the blockchain. This data cannot be tampered with by the entity ends, thereby ensuring the openness and accuracy of the data. At the same time, the smart contract is used to trigger the execution of the entity end, which can effectively supervise the service quality of the service end.

Description

Technical Field

[0001] The present invention relates to distributed storage technology, and in particular to a decentralized service supervision method and device. Background Art

[0002] Under the modern market mechanism, service quality and user experience are particularly important. In order to develop and occupy the market, more and more service terminals have emerged. However, since there are many and scattered service terminals, and the persons in charge of each service terminal act independently, they do not consider the mutual interests between the service terminals, which causes losses to the managers. Therefore, how to enable managers to effectively supervise the service quality of the service terminals is the top priority of management.

[0003] In the existing technology, managers are required to conduct on-site inspections at each service end, which is inefficient. In addition, since managers do not stay at each service end for a long time, the supervision effect is poor.

[0004] Therefore, how to assist managers in effectively supervising the service quality of the service end has become an urgent problem that needs to be solved. Summary of the Invention

[0005] The embodiments of the present invention provide a decentralized service supervision method and apparatus, which can effectively supervise the service quality of a server.

[0006] A first aspect of an embodiment of the present invention provides a decentralized service supervision method, comprising:

[0007] receiving reward and punishment information uploaded by each entity terminal, wherein the reward and punishment information corresponds to the service quality of the entity terminal;

[0008] Based on the Proof of Stake consensus, the reward and punishment information uploaded by each entity is linked and stored;

[0009] Based on the smart contract and the reward and punishment information, obtain the execution results of each entity end;

[0010] The Proof of Stake consensus includes:

[0011] An election committee consisting of M entity terminals is randomly generated from N entity terminals, where M is less than N;

[0012] An election committee elects a block-producing entity from M entities and Y trusted entities from N entities, where Y is greater than M and less than N. The block-producing entity and Y trusted entities constitute a distributed storage blockchain system.

[0013] Packaging the reward and punishment data of the entity end based on the block producing entity end, obtaining the current block of the reward and punishment information, wherein the reward and punishment data includes a reward certificate and a penalty certificate;

[0014] The current block is broadcasted by the block-producing entity, and all nodes store the current block in conjunction with the previous block.

[0015] Optionally, in a possible implementation of the first aspect, the severity levels of the penalty certificate include a first level and a second level, the first level corresponds to a certificate of non-compliance with standards for routine matters, and the second level corresponds to a certificate of non-compliance with standards for major matters.

[0016] Optionally, in a possible implementation of the first aspect, if the severity level of the penalty proof is the first level, the block-producing entity packages and processes the penalty proof to generate the current block.

[0017] Optionally, in a possible implementation of the first aspect, if the severity level of the penalty certificate is level two, forward the penalty certificate to an off-chain community for notarization;

[0018] Receive the notarization results from the off-chain community and publish them to the entire network;

[0019] If the notarization result indicates that the penalty certificate is the second level, the equity of the entity end pointed to by the penalty certificate is deducted; if the notarization result indicates that the penalty certificate is not the second level, the equity of the entity end that uploaded the penalty certificate is deducted.

[0020] Optionally, in a possible implementation of the first aspect, the method further includes:

[0021] Granting verification rights to the block-producing entity based on Y trusted entities;

[0022] If the severity level of the penalty certificate is level 2, forward the penalty certificate to the off-chain community for notarization;

[0023] Receive the notarization results from the off-chain community and publish them to the entire network;

[0024] Verify the notarization result based on the verification authority of the block-producing entity to obtain a verification result;

[0025] If the verification result indicates that the penalty certificate is the second level, the equity of the entity end pointed to by the penalty certificate is deducted; if the verification result indicates that the penalty certificate is not the second level, the equity of the entity end that uploaded the penalty certificate is deducted.

[0026] Optionally, in a possible implementation of the first aspect, the method further includes:

[0027] Providing rights and interests to the off-chain community based on the publishing end.

[0028] Optionally, in a possible implementation of the first aspect, the method further includes:

[0029] Based on the publishing end, the block-producing entity end provides equity, wherein the block-producing entity end and Y trusted entity ends distribute equity under the automatic execution of the smart contract.

[0030] Optionally, in a possible implementation of the first aspect, the method further includes:

[0031] Based on the publishing end providing rights and interests to the entity end that uploads the reward and punishment data.

[0032] A second aspect of an embodiment of the present invention provides a decentralized service monitoring device, including:

[0033] A data module is used to receive reward and punishment information uploaded by each entity terminal, wherein the reward and punishment information corresponds to the service quality of the entity terminal;

[0034] A consensus module, used to link and store the reward and punishment information uploaded by each entity based on the proof-of-stake consensus;

[0035] A result module is used to obtain the execution results of each entity end based on preset rules and the reward and punishment information;

[0036] The Proof of Stake consensus includes:

[0037] An election committee consisting of M entity terminals is randomly generated from N entity terminals, where M is less than N;

[0038] An election committee elects a block-producing entity from M entities and Y trusted entities from N entities, where Y is greater than M and less than N. The block-producing entity and Y trusted entities constitute a distributed storage blockchain system.

[0039] Packaging the reward and punishment data of the entity end based on the block producing entity end, obtaining the current block of the reward and punishment information, wherein the reward and punishment data includes a reward certificate and a penalty certificate;

[0040] The current block is broadcasted by the block-producing entity, and all nodes store the current block in conjunction with the previous block.

[0041] A third aspect of an embodiment of the present invention provides a decentralized service supervision device, comprising: a memory, a processor, and a computer program, wherein the computer program is stored in the memory, and the processor runs the computer program to execute the first aspect of the present invention and various methods that may be involved in the first aspect.

[0042] According to a fourth aspect of an embodiment of the present invention, a readable storage medium is provided, in which a computer program is stored. When the computer program is executed by a processor, it is used to implement the first aspect of the present invention and various methods that may be involved in the first aspect.

[0043] The present invention provides a decentralized service supervision method and device, which connects various entity terminals to form a blockchain system that communicates with each other. Each entity terminal serves as a node of the blockchain system. For management, the reward and punishment information of each entity terminal is linked and stored. The proof-of-stake consensus mechanism is used during storage, so that the reward information is stored in the blockchain. This data cannot be tampered with by the entity terminals, ensuring the openness and accuracy of the data. At the same time, smart contracts are used to trigger the execution of the entity terminals, which can effectively supervise the service quality of the entity terminals. BRIEF DESCRIPTION OF THE DRAWINGS

[0044] Figure 1 This is a flowchart of a decentralized service supervision method provided by an embodiment of the present invention;

[0045] Figure 2 This is a schematic diagram of the structure of a distributed storage blockchain system provided by an embodiment of the present invention;

[0046] Figure 3 This is a schematic diagram of the structure of a decentralized service monitoring device provided by an embodiment of the present invention;

[0047] Figure 4 This is a schematic diagram of the hardware structure of a decentralized service monitoring device provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0048] To make the objectives, technical solutions, and advantages of the embodiments of the present invention more clear, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making creative efforts shall fall within the scope of protection of the present invention.

[0049] The terms "first," "second," "third," "fourth," and so forth (if any) in the description and claims of the present invention and the accompanying drawings are used to distinguish similar objects and are not necessarily used to describe a particular order or sequential sequence. It should be understood that the terms used in this manner are interchangeable where appropriate, such that the embodiments of the present invention described herein can be practiced in sequences other than those illustrated or described herein.

[0050] It should be understood that in various embodiments of the present invention, the size of the sequence number of each process does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present invention.

[0051] It should be understood that in the present invention, "include" and "have" and any variations thereof are intended to cover non-exclusive inclusions. For example, a process, method, system, product or apparatus that includes a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to these processes, methods, products or apparatuses.

[0052] It should be understood that in the present invention, "multiple" refers to two or more. "And / or" is only a description of the association relationship of associated objects, indicating that three relationships can exist. For example, and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone. The character " / " generally indicates that the previous and next associated objects are in an "or" relationship. "Contains A, B and C", "Contains A, B, C" means that A, B, and C are all included, "Contains A, B or C" means that one of A, B, and C is included, and "Contains A, B and / or C" means that any one, any two, or any three of A, B, and C are included.

[0053] It should be understood that, in the present invention, "B corresponding to A," "B corresponding to A," "A corresponds to B," or "B corresponds to A" means that B is associated with A and B can be determined based on A. Determining B based on A does not mean determining B based solely on A; B can also be determined based on A and / or other information. A and B match when the similarity between A and B is greater than or equal to a preset threshold.

[0054] Depending on the context, "if" as used herein may be interpreted as "when" or "when" or "in response to determining" or "in response to detecting."

[0055] The following specific embodiments are used to describe the technical solution of the present invention in detail. The following specific embodiments can be combined with each other, and the same or similar concepts or processes may not be described in detail in some embodiments.

[0056] See also Figure 1 , is a flowchart of a decentralized service supervision method provided by an embodiment of the present invention, Figure 1The execution subject of the method shown may be a software and / or hardware device. The execution subject of the present application may include but is not limited to at least one of the following: user equipment, network equipment, etc. Among them, the user equipment may include but is not limited to computers, smart phones, personal digital assistants (PDAs) and the electronic devices mentioned above. Network equipment may include but is not limited to a single network server, a server group consisting of multiple network servers, or a cloud based on cloud computing consisting of a large number of computers or network servers, wherein cloud computing is a type of distributed computing, a super virtual computer composed of a group of loosely coupled computers. This embodiment does not limit this. It includes steps S101 to S103, as follows:

[0057] S101: Receive reward and punishment information uploaded by each entity terminal, where the reward and punishment information corresponds to the service quality of the entity terminal.

[0058] Specifically, the entity end can be a service end, which is used to provide entity services to users. Its service quality is related to user experience. In addition, the entity ends in this embodiment can be entity ends of the same brand. Then the service quality of each entity end will affect the operation of other related entity ends.

[0059] In this embodiment, the service quality of the entity end is referenced by reward and punishment information. For example, if it is rewarded, it means that the service quality of the entity end is good; if it is punished, it means that the service quality of the entity end is poor.

[0060] S102: Based on the consensus of proof of stake, the reward and punishment information uploaded by each entity is linked and stored.

[0061] Understandably, see Figure 2 In order to facilitate the administrator to manage all relevant entity terminals, it is necessary to connect the entity terminals. This embodiment connects the entity terminals to form a blockchain system that communicates with each other, in which each entity terminal serves as a node of the blockchain system.

[0062] For management purposes, the reward and punishment information of each entity needs to be linked and stored. The proof-of-stake consensus mechanism is used to store the reward information in the blockchain. This data cannot be tampered with by the entity, ensuring the openness and accuracy of the data.

[0063] Among them, the Proof of Stake consensus includes:

[0064] An election committee consisting of M entity terminals is randomly generated from N entity terminals, where M is less than N;

[0065] An election committee elects a block-producing entity from M entities and Y trusted entities from N entities, where Y is greater than M and less than N. The block-producing entity and Y trusted entities constitute a distributed storage blockchain system.

[0066] Packaging the reward and punishment data of the entity end based on the block producing entity end, obtaining the current block of the reward and punishment information, wherein the reward and punishment data includes a reward certificate and a penalty certificate;

[0067] The current block is broadcasted by the block-producing entity, and all nodes store the current block in conjunction with the previous block.

[0068] It can be understood that the distributed storage blockchain system of this solution is composed of various entity end nodes, including block-producing entity end nodes and Y trusted entity end nodes, and then the block-producing entity end is used to package the reward and punishment data to form blocks for linked storage.

[0069] In some embodiments, the election committee comprising M entity terminals randomly generated from N entity terminals may be selected according to a preset election model, which is as follows:

[0070] First, set the participating N nodes to Nodes:={node i |i=1,2,…,n},{PrivateKey i ,PublicKey i} is a node i The private key and public key, seed i T It is a node i The random number generator seed proposed in round T, S i (Message):=σ(Message,PrivateKey i ) is a node i Before the random number generation algorithm starts to sign the message, {PublicKey i} i＝1,2…n Has been broadcast to each node. Each round of node i Broadcast information M i T =(Address i ,seed i T ,S i (seed i T ),S i (ζ T )), S i (ζ T) is to receive M i T The node confirms M i T It is the basis for information participation in round T.

[0071] It should be noted that the above is an advance setting for this preset election model.

[0072] After the preset election model is set, in round T, each node i A binary seed of fixed length L will be proposed i T , the choice of L depends on the total number of nodes n, Each round is based on the random number ζ of this round T and {seed i T |i=1,2,…,n} Sort the nodes by the following step P1 to select the first M nodes. Then generate the random number ζ for round T+1 by step P2 T+1 , that is, the random number ζ T+1 It is the random number of T+1 rounds, and the random number of each round is a binary number of fixed length R.

[0073] It should be noted that the above is the framework of this preset election model.

[0074] It can be understood that after the above multiple rounds of random elections, the top M nodes can be selected as the election committee.

[0075] Among them, step P1 (according to the random number ζ of the current round) T Sorting Nodes) Specifically includes, for any s, r, d:

[0076] AppendR(s,r,d):=LeftShift(s,r)+d

[0077] Among them, LeftShift(s,r) is an operation of shifting s left by r bits.

[0078] Each node receives and confirms the seeds proposed by all nodes i T , and the selected hash function Hash (the hash function Hash can be selected according to the required hash result length, and the selection range of Hash is not limited here). Here, the length of the hash result is agreed to be L h ,calculate

[0079] GS i T :=Hash(Trunked(AppendR(ζ T ,R,seedi T ),R))

[0080] Among them, Trunked(s,l) is the operation of removing the leftmost l bits of the binary number s, and R is the seed i T length.

[0081] Intercept GS i T A section of the number RS ​​used for the final sort i T (For any binary number r, let r[a:b] be the result of intercepting r from the ath to the b-1th bit):

[0082]

[0083] Dist secondary (i):=Count #1 (XOR(Trunked(Address i ,Len(Address i )-R),ζ T ))

[0084] Among them, XOR(a,b) is the bit-by-bit exclusive OR of binary numbers a and b of the same length, Trunked(s,l) is the operation of removing the leftmost l bits of the binary number s, and Len(A) is the length of A.

[0085] Finally, according to RS i T Sort in ascending order and select the first M as the committee for the current round. If the same situation occurs, according to Dist secondary (i) Size determines priority, smaller ones have higher priority.

[0086] Step P2 (combine the first and last digits in the order in P1 to form the random number ζ for the next round) T+1 ) specifically include:

[0087] In step P1, we record the last node of the ascending sort and call the corresponding node Last, and the first node of the ascending sort is First.

[0088]

[0089] It is understandable that this step can generate the random number ζ for round T+1. T+1 .

[0090] It should be noted that this scheme uses a preset election model and adopts multiple rounds of random selection to randomly select M nodes from any N nodes as the committee. All N nodes participate in the selection process, and the selection process will not be manipulated by a small number of participants.

[0091] S103, based on the smart contract and the reward and punishment information, obtain the execution results of each entity end.

[0092] Specifically, in order to effectively supervise each entity end, the manager can manage each entity end based on the set smart contract. The smart contract can be, for example, an agreement between the entity ends. For example, when two or more penalty certificates are generated, the entity end will be punished by suspension of business. For another example, when a reward certificate is generated, the entity end will be rewarded with equity.

[0093] Based on the above embodiment, this embodiment further performs the following processing on reward and punishment information:

[0094] In actual applications, the severity levels of penalty certificates include the first level and the second level. The first level corresponds to the certificate of non-compliance with standards for routine matters, such as substandard service attitude, and the second level corresponds to the certificate of non-compliance with standards for major matters, such as product quality issues.

[0095] Accordingly, if the severity level of the penalty proof is level 1, the block-producing entity packages the penalty proof and generates the current block. It is understandable that if the severity level is not particularly severe, then the block-producing entity can simply package the penalty proof.

[0096] In practical applications, if the severity level of the penalty proof is the second level, two methods can be used to align and verify the proof to ensure that the penalty proof is accurate.

[0097] Method 1:

[0098] Forward the penalty certificate to the off-chain community for notarization; receive the notarization result from the off-chain community and publish it to the entire network; if the notarization result indicates that the penalty certificate is the second level, deduct the equity of the entity end pointed to by the penalty certificate; if the notarization result indicates that the penalty certificate is not the second level, deduct the equity of the entity end that uploaded the penalty certificate.

[0099] It is understandable that the second-level penalty proof is more serious and requires careful review. Therefore, this embodiment forwards the penalty proof to the off-chain community for notarization to obtain a notarization result. If it is indeed the second level, then the equity of the entity end pointed to by the penalty proof will be deducted. If not, then the equity of the entity end that uploaded the penalty proof will be deducted. Effective service supervision is carried out in turn, and the person who uploaded the reward and punishment proof can also be supervised.

[0100] Method 2:

[0101] Granting verification rights to the block-producing entity based on Y trusted entities;

[0102] If the severity level of the penalty certificate is level 2, forward the penalty certificate to the off-chain community for notarization;

[0103] Receive the notarization results from the off-chain community and publish them to the entire network;

[0104] Verify the notarization result based on the verification authority of the block-producing entity to obtain a verification result;

[0105] If the verification result indicates that the penalty certificate is the second level, the equity of the entity end pointed to by the penalty certificate is deducted; if the verification result indicates that the penalty certificate is not the second level, the equity of the entity end that uploaded the penalty certificate is deducted.

[0106] It is understandable that the second-level penalty proof is more serious and requires careful review. This method uses Y trusted entity terminals to grant the block-producing entity terminal verification rights, and then forwards the penalty proof to the off-chain community for notarization to obtain the verification result. The verification result is then verified with the verification right of the block-producing entity terminal. If it is indeed the second level, the rights and interests of the entity terminal pointed to by the penalty proof will be deducted. If not, the rights and interests of the entity terminal that uploaded the penalty proof will be deducted. Effective service supervision is carried out in turn, and the uploader of the reward and punishment proof can also be supervised.

[0107] It should be noted that this method uses multiple verifications by the off-chain community and the block-producing entity to improve the accuracy of the verification results, thereby ensuring that the penalty information is accurate and avoiding misjudgment of the entity.

[0108] On the basis of the above embodiment, rights and interests may also be provided to the off-chain community based on the publishing end, wherein the publishing end may be, for example, the business publisher of each entity end, and each entity end is supervised by the publishing end.

[0109] In addition, the issuing end may provide rights and interests to the block-producing entity end, wherein the block-producing entity end and Y trusted entity ends distribute rights and interests under the automatic execution of the smart contract.

[0110] In addition, in order to encourage users to actively cooperate with supervision, rights and interests can also be provided to the entity end that uploads the reward and punishment data based on the publishing end.

[0111] See also Figure 3 , is a schematic diagram of the structure of a decentralized service supervision device provided by an embodiment of the present invention. The decentralized service supervision device 30 includes:

[0112] The data module 31 is used to receive reward and punishment information uploaded by each entity terminal, wherein the reward and punishment information corresponds to the service quality of the entity terminal;

[0113] The consensus module 32 is used to link and store the reward and punishment information uploaded by each entity terminal based on the equity proof consensus;

[0114] A result module 33 is used to obtain the execution results of each entity end based on preset rules and the reward and punishment information;

[0115] The Proof of Stake consensus includes:

[0116] An election committee consisting of M entity terminals is randomly generated from N entity terminals, where M is less than N;

[0117] An election committee elects a block-producing entity from M entities and Y trusted entities from N entities, where Y is greater than M and less than N. The block-producing entity and Y trusted entities constitute a distributed storage blockchain system.

[0118] Packaging the reward and punishment data of the entity end based on the block producing entity end, obtaining the current block of the reward and punishment information, wherein the reward and punishment data includes a reward certificate and a penalty certificate;

[0119] The current block is broadcasted by the block-producing entity, and all nodes store the current block in conjunction with the previous block.

[0120] Figure 3 The apparatus of the embodiment shown can be used to perform Figure 1 The implementation principles and technical effects of the steps in the method embodiment shown are similar and will not be repeated here.

[0121] See also Figure 4 , is a hardware structure diagram of a decentralized service supervision device provided by an embodiment of the present invention, the decentralized service supervision device 40 includes: a processor 41, a memory 42 and a computer program; wherein

[0122] The memory 42 is used to store the computer program, which may also be a flash memory. The computer program is, for example, an application program or a functional module for implementing the above method.

[0123] The processor 41 is configured to execute the computer program stored in the memory to implement the various steps performed by the device in the above method. For details, please refer to the relevant description in the above method embodiment.

[0124] Optionally, the memory 42 may be independent or integrated with the processor 41 .

[0125] When the memory 42 is a device independent of the processor 41, the device may further include:

[0126] The bus 43 is used to connect the memory 42 and the processor 41 .

[0127] The present invention also provides a readable storage medium, in which a computer program is stored. When the computer program is executed by a processor, it is used to implement the methods provided in the various embodiments described above.

[0128] Among them, the readable storage medium can be a computer storage medium or a communication medium. Communication media include any medium that facilitates the transmission of computer programs from one place to another. Computer storage media can be any available medium that can be accessed by a general-purpose or special-purpose computer. For example, a readable storage medium is coupled to a processor so that the processor can read information from the readable storage medium and write information to the readable storage medium. Of course, the readable storage medium can also be an integral part of the processor. The processor and the readable storage medium can be located in an application-specific integrated circuit (ASIC). In addition, the ASIC can be located in a user device. Of course, the processor and the readable storage medium can also exist in a communication device as discrete components. The readable storage medium can be a read-only memory (ROM), a random access memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, and an optical data storage device, etc.

[0129] The present invention also provides a program product, which includes execution instructions stored in a readable storage medium. At least one processor of a device can read the execution instructions from the readable storage medium, and at least one processor executes the execution instructions so that the device implements the methods provided in the various embodiments described above.

[0130] In the embodiments of the above-mentioned devices, it should be understood that the processor may be a central processing unit (CPU), other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), etc. The general-purpose processor may be a microprocessor or any conventional processor. The steps of the method disclosed in the present invention may be directly implemented by a hardware processor or implemented by a combination of hardware and software modules in the processor.

[0131] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the above embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the above embodiments, or replace some or all of the technical features therein with equivalents. However, these modifications or replacements do not cause the essence of the corresponding technical solutions to deviate from the scope of the technical solutions of the embodiments of the present invention.

Claims

1. A decentralized service supervision method, characterized in that: include: Receive reward and punishment information uploaded by each entity, where the reward and punishment information corresponds to the service quality of the entity; Based on the Proof of Stake consensus, the reward and punishment information uploaded by each entity is linked and stored; Based on the smart contract and the reward and punishment information, obtain the execution results of each entity end; Among them, the Proof of Stake consensus includes: An election committee consisting of M entity terminals is randomly generated from N entity terminals, where M is less than N; Based on the election committee, a block-producing entity is elected from M entities, and Y trusted entities are elected from N entities, where Y is greater than M and less than N. The block-producing entity and Y trusted entities constitute a distributed storage blockchain system; Based on the reward and punishment data packaging of the block-producing entity, the current block of reward and punishment information is obtained. The reward and punishment data includes reward proof and penalty proof; The current block is broadcasted by the block-producing entity, and all nodes store the current block in conjunction with the previous block; The election committee consisting of M entities is randomly generated from N entities and is selected based on a preset election model. The preset election model is as follows: First, set the participating N nodes as Node des: = {node i |i=1,2,…,n},{PrivateKey i , PublicKey i } is a node i The private key and public key, seed i T It is a node i The random number generator seed proposed in round T, S i (Message):=σ(Message,PrivateKey i ) is a node i Before the random number generation algorithm starts to sign the message, {PublicKey i } i＝1，2…n It has been broadcast to each node, each round of node i Broadcast information M i T =(Address i , seed i T , S i (seed i T ), S i (ζ T )), S i (ζ T ) is to receive M i T The node confirms M i T is the basis for participating in the information of round T; After the preset election model is set, in round T, each node i A binary seed of fixed length L will be proposed i T , the choice of L depends on the total number of nodes n, Each round is based on the random number ζ of this round T and {seed i T |i=1,2,…,n} sort the nodes to select the first M nodes and then generate the random number ζ for T+1 rounds T+1 , that is, the random number ζ T+1 It is the random number of round T+1, and the random number of each round is a binary number of fixed length R; After multiple rounds of random elections, the top M nodes are selected as the election committee.

2. The method according to claim 1, characterized in that The severity levels of the penalty certificate include a first level and a second level, the first level corresponds to a certificate of non-compliance with standards for routine matters, and the second level corresponds to a certificate of non-compliance with standards for major matters.

3. The method according to claim 1, characterized in that If the severity level of the penalty proof is the first level, the block-producing entity packages the penalty proof and generates the current block.

4. The method according to claim 2 or 3, characterized in that If the severity level of the penalty certificate is level 2, forward the penalty certificate to the off-chain community for notarization; Receive the notarization results from the off-chain community and publish them to the entire network; If the notarization result indicates that the penalty certificate is the second level, the equity of the entity end pointed to by the penalty certificate is deducted; if the notarization result indicates that the penalty certificate is not the second level, the equity of the entity end that uploaded the penalty certificate is deducted.

5. The method according to claim 2 or 3, characterized in that Also includes: Granting verification rights to the block-producing entity based on Y trusted entities; If the severity level of the penalty certificate is level 2, forward the penalty certificate to the off-chain community for notarization; Receive the notarization results from the off-chain community and publish them to the entire network; Verify the notarization result based on the verification authority of the block-producing entity to obtain a verification result; If the verification result indicates that the penalty certificate is the second level, the equity of the entity end pointed to by the penalty certificate is deducted; if the verification result indicates that the penalty certificate is not the second level, the equity of the entity end that uploaded the penalty certificate is deducted.

6. The method according to claim 5, characterized in that Also includes: Providing rights and interests to the off-chain community based on the publishing end.

7. The method according to claim 1, characterized in that Also includes: Based on the publishing end, the block-producing entity end provides equity, wherein the block-producing entity end and Y trusted entity ends distribute equity under the automatic execution of the smart contract.

8. The method according to claim 1, characterized in that Also includes: Based on the publishing end providing rights and interests to the entity end that uploads the reward and punishment data.

9. A decentralized service monitoring device, characterized in that: A decentralized service supervision method according to any one of claims 1 to 8, comprising: A data module is used to receive reward and punishment information uploaded by each entity terminal, wherein the reward and punishment information corresponds to the service quality of the entity terminal; A consensus module, used to link and store the reward and punishment information uploaded by each entity based on the proof-of-stake consensus; A result module is used to obtain the execution results of each entity end based on preset rules and the reward and punishment information; The Proof of Stake consensus includes: An election committee consisting of M entity terminals is randomly generated from N entity terminals, where M is less than N; An election committee elects a block-producing entity from M entities and Y trusted entities from N entities, where Y is greater than M and less than N. The block-producing entity and Y trusted entities constitute a distributed storage blockchain system. Packaging the reward and punishment data of the entity end based on the block producing entity end, obtaining the current block of the reward and punishment information, wherein the reward and punishment data includes a reward certificate and a penalty certificate; The current block is broadcasted by the block-producing entity, and all nodes store the current block in conjunction with the previous block.

10. A readable storage medium, characterized in that: The readable storage medium stores a computer program, which is used to implement the method according to any one of claims 1 to 8 when executed by a processor.

Images