EP3848875B1 - Method, device, computer apparatus and storage medium for electing representative node apparatus - Google Patents

Method, device, computer apparatus and storage medium for electing representative node apparatus Download PDF

Info

Publication number
EP3848875B1
EP3848875B1 EP19857475.8A EP19857475A EP3848875B1 EP 3848875 B1 EP3848875 B1 EP 3848875B1 EP 19857475 A EP19857475 A EP 19857475A EP 3848875 B1 EP3848875 B1 EP 3848875B1
Authority
EP
European Patent Office
Prior art keywords
voting
transaction data
node devices
blockchain system
blocks
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.)
Active
Application number
EP19857475.8A
Other languages
German (de)
English (en)
French (fr)
Other versions
EP3848875A1 (en
EP3848875A4 (en
EP3848875C0 (en
Inventor
Rui Guo
Maocai Li
Zongyou WANG
Haitao Tu
Li Kong
Kaiban ZHOU
Changqing Yang
Nan Wang
Yong Ding
Yifang SHI
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.)
Tencent Technology Shenzhen Co Ltd
Original Assignee
Tencent Technology Shenzhen 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 Tencent Technology Shenzhen Co Ltd filed Critical Tencent Technology Shenzhen Co Ltd
Publication of EP3848875A1 publication Critical patent/EP3848875A1/en
Publication of EP3848875A4 publication Critical patent/EP3848875A4/en
Application granted granted Critical
Publication of EP3848875C0 publication Critical patent/EP3848875C0/en
Publication of EP3848875B1 publication Critical patent/EP3848875B1/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION 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
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/38—Payment protocols; Details thereof
    • G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
    • G06Q20/3829—Payment protocols; Details thereof insuring higher security of transaction involving key management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
    • H04L9/3239—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION 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/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION 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
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/04—Payment circuits
    • G06Q20/06—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme
    • G06Q20/065—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme using e-cash
    • G06Q20/0658—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme using e-cash e-cash managed locally
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/12—Applying verification of the received information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1044—Group management mechanisms 
    • H04L67/1051—Group master selection mechanisms
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0894—Escrow, recovery or storing of secret information, e.g. secret key escrow or cryptographic key storage
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
    • H04L2209/46—Secure multiparty computation, e.g. millionaire problem
    • H04L2209/463—Electronic voting

Definitions

  • This application relates to the field of blockchain technologies, and in particular, to a method and an apparatus for electing a representative node device, a computer device, and a storage medium.
  • a blockchain system may include a plurality of node devices. Each node device may store transaction data by using blocks and combine the blocks by sequentially connecting the blocks in chronological order into a chain data structure, to form a distributed ledger in the blockchain system.
  • node devices may generate a block through the following process: When a transaction occurs on any node device, the node device may record transaction data and broadcast the transaction data in a blockchain system, so that node devices in the blockchain system receive the transaction data. After the node devices in the blockchain system receive the transaction data, the node devices may package the transaction data to generate a new block, and perform verification on the new block by using a consensus mechanism. After the new block is verified, each node device may add the new block to a target blockchain configured on the node devices.
  • each node device in the blockchain system needs to generate a new block.
  • a quantity of the node devices in the blockchain system is relatively large, working efficiency of the blockchain system is relatively low. Therefore, a representative node device is needed to take place of all node devices for generating a block, to improve working efficiency of the blockchain system.
  • US 2017/323392 A1 concerns a peer-to-peer consensus system and a method for maintaining a manipulation resistant updateable shared ledger.
  • the system achieves consensus on a shared ledger between a plurality of peers and prevents double spending in light of network latency, data corruption and intentional manipulation of the system. Consensus is achieved and double spending is prevented via the use of the widest chain metric to choose a single consensus transaction record.
  • the present invention concerns a method for electing a representative node device according to claim 1, an apparatus for electing a representative node device according to claim 8, a computer device according to claim 11, and a non-volatile computer-readable storage medium according to claim 12. Further aspects of the present invention are defined in the dependent claims. A method and an apparatus for electing a representative node device, a computer device, and a storage medium are provided in embodiments of this application.
  • a method for electing a representative node device is provided. The method is performed by a first node device, the first node device being any node device in a blockchain system, and the method includes:
  • An apparatus for electing a representative node device including:
  • a computer device includes a processor and a memory, the memory storing computer-readable instructions, the computer-readable instructions, when executed by the processor, causing the processor to perform the following operations:
  • a non-volatile computer-readable storage medium stores computer-readable instructions, the computer-readable instructions, when executed by one or more processors, causing the one or more processors to perform the following operations:
  • FIG. 1 is a schematic structural diagram of a blockchain system according to an embodiment of this application.
  • the system includes a plurality of servers.
  • the plurality of servers may be equipped with a same blockchain. That is, the plurality of servers may form a blockchain system, and the servers are separately node devices in the blockchain system.
  • the plurality of servers may be a plurality of servers of a same organization, a plurality of servers belonging to different organizations, or a plurality of servers of ordinary users.
  • all of the plurality of servers can receive transaction data.
  • the node devices may be classified into representative node devices and non-representative node devices.
  • a representative node device is configured to generate a block and performing verification on the block by consensus.
  • a non-representative node device is configured to receive the block that is generated by the representative node device and that is verified by the representative node device by consensus, perform verification on the block, and store the verified block on a target blockchain.
  • the node device needs to broadcast the received transaction data in the blockchain system, to help another node device receive the transaction data.
  • the representative node device in the blockchain system receives the transaction data
  • the representative node device generates a block based on the transaction data, to help all representative node devices perform verification on the block by consensus.
  • the representative node devices verify the block by consensus
  • the representative node device broadcasts the block in the blockchain system.
  • the non-representative node device performs verification on the block. After being verified, the block is stored on the target blockchain configured on the non-representative node device.
  • the consensus included in this embodiment of this application means that a plurality of node devices in the blockchain system separately perform verification on data. In a case that verification performed by any node device succeeds, a verification success message is broadcast in the blockchain system. In a case that the verification success message received by any node device meets a preset consensus policy, it is determined that the data is verified by consensus.
  • the representative node device in the blockchain system generates a block.
  • the representative node device calculates a hash value of a block header of the generated block and determines whether the hash value is less than a current target value. In a case that the hash value is greater than the target value, the representative node device changes a random number in the generated block and recalculates the hash value. In a case that the hash value calculated by the representative node device is less than the target value, the representative node device broadcasts the block to other representative node devices or in the blockchain system. Other representative node devices perform verification the block after receiving the block. In a case that most of the other representative node devices all agree with validity of the block, the block is verified by consensus.
  • FIG. 2 is a flowchart of a method for electing a representative node device according to an embodiment of this application. Referring to FIG. 2 , a process of the method according to this embodiment of this application includes the following steps.
  • a first node device receives voting transaction data of a user.
  • the first node device in a blockchain system is any node device in the blockchain system.
  • a type of a transaction initiated by user equipment to the first node device may include a voting transaction and another transaction.
  • the voting transaction data is a type of transaction data, and may be generated based on a voting target of a user in the blockchain system.
  • the node device obtains voting transaction data, and the voting transaction data may include: a transaction type, a list of node devices that are voted for, a private key signature of a voting user, and the like.
  • the blockchain system performs initialization and determines an initial representative node device.
  • the initial representative node device is a node device configured to generate a block and perform verification on the block by consensus in the blockchain system in a case that no election is performed.
  • a public key of the initial representative node device may be stored in a genesis block of a blockchain, so that all node devices in the blockchain system know the public key of the initial representative node device, the public key being used for indicating an identity of the initial representative node device.
  • a network protocol address of the initial representative node device may also be stored in the genesis block, so that all of the node devices in the blockchain system know the network protocol address of the initial representative node device.
  • the initial representative node device in the blockchain may learn of its identity as the representative node device from the public key of the initial representative node device stored in the genesis block.
  • the initial representative node device operates in a representative node device state.
  • a non-representative node device may also learn of its identity as a non-representative node device from the public key, and then the non-representative node device operates in a non-representative node device state.
  • the first node device broadcasts the voting transaction data in the blockchain system.
  • the broadcasting may enable all of the node devices in the blockchain system to receive the voting transaction data.
  • the first node device directly receives the voting transaction data generated by the user logging in to the first node device for voting.
  • the first node device may directly receive the voting transaction data broadcast by another node device after the user logs in to the another node device for voting. This is not specifically limited in this embodiment of this application.
  • Second node devices receive the voting transaction data.
  • the second node devices are node devices in the blockchain system other than the first node device. None of the attributes, such as "first" and "second”, included in the embodiments of this application is used for differentiating functions of the node devices, and instead, the attributes are only used for differentiating different node devices.
  • a plurality of node devices in the blockchain system store the voting transaction data on a target blockchain of the blockchain system in a case that the plurality of node devices in the blockchain system verify the voting transaction data by consensus.
  • that the plurality of node devices verify the voting transaction data by consensus may mean that a plurality of representative node devices in the blockchain system verify the voting transaction data by consensus.
  • the initial representative node device mentioned above may be used as a node device participating in a consensus process this time.
  • the plurality of representative node devices that are obtained through the election may be switched to a running state of a representative node to participate in a process of consensus and block generation of the entire blockchain system.
  • a node device that is not elected as a representative node device is in a running state of a non-representative node device and does not participate in the process of consensus and block generation of the entire blockchain system.
  • the term "a plurality of" mentioned in this embodiment of this application means "more than one”.
  • the first node device determines a plurality of first blocks in blocks of the target blockchain in a case that a quantity of generated blocks reaches a first preset quantity, the plurality of first blocks being configured to store the voting transaction data of the node devices.
  • the first node device may search the blocks of the target blockchain based on a voting transaction type, to obtain a block storing the voting transaction type as the first block.
  • a plurality of elections may be performed during an operation process of the blockchain system, to avoid a system operation problem caused by an exception of a specific representative node device, for example, a specific representative node device operating in an abnormal state or having a credit problem and the like, thereby ensuring steady operation of the blockchain system based on the representative node device.
  • a specific representative node device for example, a specific representative node device operating in an abnormal state or having a credit problem and the like
  • the generated blocks are blocks generated after the previous election. Only when the quantity of the generated blocks reaches the first preset quantity, an election is performed, so that a switching time length of a representative node device, that is, how often a representative node device is switched, may be ensured, thereby avoiding switching the representative node device frequently and avoiding affecting normal operation of the entire blockchain system.
  • the generated blocks include blocks generated based on voting transaction data, may further include blocks generated based on other transaction data, and certainly, may further include blocks generated based on voting transaction data and other transaction data. Details are not described in this embodiment of this application again.
  • All the node devices in the blockchain system may execute the process of step S205, and details are not described in this embodiment of this application again.
  • the first node device determines, according to the voting transaction data stored in the plurality of first blocks, quantities of votes for the node devices in the blockchain system.
  • the voting transaction data includes a transaction type, a list of node devices that are voted for, a private key signature of a voting user, and the like. Therefore, according to the voting transaction data stored on respective first blocks, a quantity of votes obtained by each node device may be counted.
  • the incremental voting refers to indicating a node device that is voted for in a voting transaction and keeping historical voting results. For example, in a case that a user has voted for three node devices A, B and C, and an object of this voting is a node device D, during this voting, the user may directly vote for the node device D.
  • a list of node devices that are voted for in the voting transaction data carries a public device key of the node device D. That is, the user votes for, through a plurality of rounds of voting, the four node devices A, B, C, and D.
  • a vote for a node device that is voted for may be withdrawn. For example, a user has already voted for three node devices A, B and C, and if the user wants to withdraw a vote for the node device C next time, the user may directly indicate withdrawal of the vote for the node device C in the voting transaction data during next voting.
  • the full voting refers to that for each transaction, it is needed to indicate a node device that is voted for and that a previous vote is invalid. For example, in a case that the user has voted for a node device A and a node device B, and next voting objects are a node device C and a node device D, in the next voting, the user not only needs to indicate voting for the node device C and the node device D, but also needs to directly overwrite previous votes for the node device A and the node device B.
  • corresponding voting weights may be set for different users, the weight being used for indicating an influence degree on the blockchain system.
  • the weight may be used for determining an influence of a vote cast by a user on the entire election. For example, in a case that a weight of a specific user is 5, the user may vote for 5 node devices, that is, the user has a voting right to cast 5 votes.
  • a specific stage in which the weight is set is not limited in this embodiment of this application.
  • the weights may be set when the quantities of votes are counted.
  • the weights may alternatively be determined by the first node device when the first node device generates the voting transaction data, and be carried in the voting transaction data.
  • the weights may be set based on different parameters.
  • the parameter may be an account balance of a user, that is, a larger account balance indicates a higher weight that is set for the user.
  • a parameter may alternatively be a credit value of a user, that is, a larger credit value of the user indicates a higher weight that is set for the user.
  • the specific parameters used for setting may be different according to different application objects of the blockchain system.
  • the weight may be set according to the account balance of the user.
  • the weight may be set according to the credit value of the user.
  • a voting user may also be limited, to prevent the limited voting user from participating in the voting.
  • a voting user may also be limited, to prevent the limited voting user from participating in the voting.
  • a voting user may also be limited, to prevent the limited voting user from participating in the voting.
  • a blockchain system only by an institution or an organization can initiate a voting for the representative node device, and an ordinary user cannot cast a vote.
  • the blockchain system may also specify a quantity of votes possessed by each user, that is, how many votes each user can cast at most.
  • the user may alternatively specify a quantity of votes or a weight obtained by a voting object, but the quantity of votes cannot exceed a total quantity of votes possessed by the user.
  • the first node device determines an election result in descending order by a quantity of votes, the election result including a second preset quantity of representative node devices in the blockchain system.
  • the second preset quantity may be kept consistent with the quantity of current working representative node devices. That is, it can be ensured through setting of the second preset quantity that the current working representative node devices can all be replaced with the elected representative node devices.
  • the second preset quantity may alternatively be changed.
  • the second preset quantity may be changed according to the quantity of node devices in the blockchain system, and in a case that the quantity of the node devices is increased, the second preset quantity may be increased.
  • the first node device may determine whether it is a newly elected representative node device according to the election result determined by itself. That is, any node device in the blockchain system may determine, according to an election result obtained by itself through counting, whether it is a newly elected representative node device, and identities of other representative node devices that are newly elected this time.
  • Steps S205 to S207 are an implementation of a process of determining, by the first node device according to quantities of votes of the plurality of candidate node devices, a plurality of representative node devices in the blockchain system, that is, a process of determining, according to the voting transaction data stored in the plurality of first blocks, the second preset quantity of representative node devices in the blockchain system.
  • the quantities of votes may be counted by in a manner of setting a vote list, to make an election.
  • Each node device may maintain a vote list, the vote list being used for storing the quantities of votes for the node devices.
  • an update may be performed based on each voting of the blockchain system, or an update may be performed based on the plurality of first blocks on the target blockchain at an interval of a preset time length or in a case that the quantity of generated blocks reaches a preset quantity. This is not limited in this embodiment of this application.
  • verification may be performed on the vote list by using the transaction data stored on the blockchain system, so that the election may be performed based on the vote list.
  • an update process may be as follows:
  • the voting manner in the blockchain system is the incremental voting
  • the vote list stored on the node devices may be updated according to the voting transaction data of users stored in the first blocks.
  • voting objects of the last but one voting of a user on a first block are three node devices A, B, and C.
  • a voting object of the last voting is a node device D.
  • voting objects of the last but one voting further need to be queried for in the target blockchain.
  • voting objects of each time are queried for, and the vote list is updated according to a query result.
  • the full voting is a voting manner of performing the voting based on overwriting a previous voting result. Therefore, in a case that the voting manner in the blockchain system is the full voting, the vote list stored on the node devices may be updated according to the voting transaction data of the last voting of users stored in the first blocks. For example, on a first block, voting objects of the last but one voting of a user are three node devices A, B, and C. The last voting is performed to vote for a node device D, and the previous votes for the three node devices A, B, and C are overwritten. Therefore, a vote may be directly added for the node device D to the vote list during the update of the vote list.
  • the quantities of votes for the node devices on the vote list may be sorted in descending order, to determine the second preset quantity of representative node devices. Further, the voting manner may also be performed in combination with the weights. The detailed combination manner is the same as the foregoing descriptions of the weights, and details are not described herein.
  • a representative node device newly elected this time switches to an operating state of a representative node device for operation.
  • the representative node device newly elected may learn that it is elected as a representative node device, so that the representative node device newly elected this time switches to the operating state of a representative node device and starts to work.
  • representative node devices are elected in a blockchain system by voting for node devices in the blockchain system.
  • the representative node devices take place of all node devices in the blockchain system to generate new blocks for the target blockchain and perform verification on the new blocks by consensus and the like, to prevent the node devices from all performing the foregoing process, thereby greatly improving working efficiency of the blockchain system.
  • the election manner may be the incremental voting or the full voting. Based on different voting manners or weights set for users, different vote counting methods may be selected, to provide a more flexible election manner for the election of the representative node devices in the blockchain system. Quantities of votes for the node devices in the blockchain system are counted and sorted in descending order at an interval of generating a first preset quantity of blocks, to elect the representative node devices. The manner can further control a switching time length of the representative node devices, thereby avoiding frequent switching of the representative node devices and avoid that the blockchain system cannot work normally. In addition, the blockchain system performs a plurality of elections, to prevent some representative node devices that cannot work normally from being switched, to maintain normal operation of the blockchain system.
  • FIG. 3 is a schematic structural diagram of an apparatus for electing a representative node device according to an embodiment of this application.
  • the apparatus includes a first obtaining module 301, a storage module 302, and a determining module 303.
  • the first obtaining module 301 is connected to the storage module 302, and is configured to obtain voting transaction data, the voting transaction data being used for voting for at least one node device in a blockchain system.
  • the storage module 302 is connected to the determining module 303, and is configured to store the voting transaction data on a target blockchain in the blockchain system in a case that a plurality of node devices in the blockchain system verify the voting transaction data by consensus.
  • the determining module 303 is configured to determine, in a case that a quantity of generated blocks reaches a preset quantity, an election result according to quantities of votes of the plurality of node devices, the election result including a plurality of representative node devices in the blockchain system, the representative node devices being configured to generate new blocks for the target blockchain and perform verification on the new blocks by consensus.
  • the determining module 303 includes:
  • the representative node device determining unit includes:
  • a voting manner in the blockchain system is incremental voting, and the quantity-of-votes determining subunit is further configured to determine the quantities of votes for the node devices in the blockchain system according to transaction data of users stored in the plurality of first blocks.
  • a voting manner in the blockchain system is full voting
  • the quantity-of-votes determining subunit is configured to determine transaction data of the last voting of users from the transaction data stored in the plurality of first blocks, and determine the quantities of votes for the node devices in the blockchain system based on the transaction data of the last voting of the users.
  • a weight is set for a vote of each user participating in the voting.
  • the weight of the each user is set based on a user parameter, the user parameter including an account balance or a credit value.
  • the apparatus further includes: an update module, configured to update, in a case that the plurality of node devices in the blockchain system verify the voting transaction data by consensus, a vote list stored on the node devices according to the voting transaction data, the vote list being used for storing the quantities of votes for the node devices.
  • an update module configured to update, in a case that the plurality of node devices in the blockchain system verify the voting transaction data by consensus, a vote list stored on the node devices according to the voting transaction data, the vote list being used for storing the quantities of votes for the node devices.
  • the update module is further configured to determine transaction data of the last voting of users from the transaction data stored in the first blocks, and updating the vote list stored on the node devices based on the transaction data of the last voting of the users.
  • the update module is further configured to update the vote list stored on the node devices according to all pieces of voting transaction data of users stored in first blocks.
  • representative node devices in a blockchain system are elected in a voting manner.
  • the representative node devices can take place of all node devices in the blockchain system to generate a block, and may complete verification on a new block by consensus, thereby improving working efficiency of the blockchain system.
  • the apparatus for electing a representative node device provided in the foregoing embodiments performs an election
  • merely divisions of the foregoing functional modules are used as an example for description.
  • the foregoing functions may be allocated to and completed by different functional modules according to requirements, that is, the internal structure of the apparatus is divided into different functional modules, to complete all or some of the foregoing described functions.
  • the method for electing a representative node device and embodiments provided in the foregoing embodiments belong to one conception. For the specific implementation process, reference may be made to the method embodiments, and details are not described herein again.
  • FIG. 4 is a schematic structural diagram of a server according to an embodiment of this application.
  • the server 400 may vary greatly due to different configurations or performance, and may include one or more processors (for example, central processing units, CPU) 401 and one or more memories 402.
  • the memories 402 store computer-readable instructions.
  • the computer-readable instructions are loaded and executed by the processors 401 to implement the method provided in the foregoing method embodiments.
  • the server may further include components such as a wired or wireless network interface, a keyboard, and an input/output interface, to facilitate inputs/outputs.
  • the server may further include another component configured to implement functions of a device, and details are not described herein again.
  • a computer-readable storage medium such as a memory including an instruction
  • the instruction may be executed by a processor in a terminal to complete the method for electing a representative node device in the foregoing embodiments.
  • the computer-readable storage medium may be a read-only memory (ROM), a random access memory (RAM), a compact disc read-only memory (CD-ROM), a magnetic tape, a floppy disk, an optical data storage device, or the like.
  • the program may be stored in a computer-readable storage medium.
  • the above-mentioned storage medium may be a ROM, a magnetic disk, an optical disc, or the like.

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Computer Security & Cryptography (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Strategic Management (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Marketing (AREA)
  • Technology Law (AREA)
  • Economics (AREA)
  • Development Economics (AREA)
  • Computing Systems (AREA)
  • Mathematical Physics (AREA)
  • Computer Hardware Design (AREA)
  • General Engineering & Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
  • Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
EP19857475.8A 2018-09-07 2019-09-03 Method, device, computer apparatus and storage medium for electing representative node apparatus Active EP3848875B1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201811046267.9A CN109165945B (zh) 2018-09-07 2018-09-07 代表节点设备选举方法、装置、计算机设备及存储介质
PCT/CN2019/104141 WO2020048436A1 (zh) 2018-09-07 2019-09-03 代表节点设备选举方法、装置、计算机设备及存储介质

Publications (4)

Publication Number Publication Date
EP3848875A1 EP3848875A1 (en) 2021-07-14
EP3848875A4 EP3848875A4 (en) 2021-10-27
EP3848875C0 EP3848875C0 (en) 2023-07-12
EP3848875B1 true EP3848875B1 (en) 2023-07-12

Family

ID=64894393

Family Applications (1)

Application Number Title Priority Date Filing Date
EP19857475.8A Active EP3848875B1 (en) 2018-09-07 2019-09-03 Method, device, computer apparatus and storage medium for electing representative node apparatus

Country Status (7)

Country Link
US (1) US11792006B2 (zh)
EP (1) EP3848875B1 (zh)
JP (1) JP6990329B2 (zh)
KR (1) KR102444468B1 (zh)
CN (1) CN109165945B (zh)
SG (1) SG11202011173XA (zh)
WO (1) WO2020048436A1 (zh)

Families Citing this family (29)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109165945B (zh) * 2018-09-07 2021-04-16 腾讯科技（深圳）有限公司 代表节点设备选举方法、装置、计算机设备及存储介质
CN109327528B (zh) * 2018-10-31 2020-10-20 创新先进技术有限公司 一种基于区块链的节点管理方法和装置
CN109639837B (zh) * 2019-01-31 2021-04-06 东南大学 基于信任机制的区块链DPoS共识方法
CN110298641B (zh) * 2019-06-12 2022-08-05 广东投盟科技有限公司 区块链的规则更新方法、装置、区块链节点及网络
CN110380847B (zh) * 2019-07-01 2021-11-19 创新先进技术有限公司 一种区块链共识方法和装置
CN110505064A (zh) * 2019-07-26 2019-11-26 深圳市网心科技有限公司 基于EC-Schnoor签名算法的门限投票方法、***及相关设备
CN110401541A (zh) * 2019-07-26 2019-11-01 深圳市网心科技有限公司 基于EC-Schnoor签名算法的门限投票方法、***及相关设备
CN110401537A (zh) * 2019-07-26 2019-11-01 深圳市网心科技有限公司 基于bls签名算法的门限投票方法、***及相关设备
CN110717761B (zh) * 2019-12-12 2020-04-03 腾讯科技（深圳）有限公司 一种数据处理方法、装置及计算机存储介质
CN111416843A (zh) * 2020-03-06 2020-07-14 厦门区块链云科技有限公司 一种区块链社群超级节点竞选方法
CN112015811B (zh) * 2020-03-16 2024-06-18 支付宝(杭州)信息技术有限公司 用于区块链***的节点管理的方法、节点和计算设备
CN111414373B (zh) * 2020-03-18 2023-09-19 深圳市迅雷网络技术有限公司 一种共识方法和共识***
CN111432014B (zh) * 2020-03-30 2023-05-05 上海玳鸽信息技术有限公司 一种区块链共识算法中主节点选取的方法和装置
CN113472825B (zh) * 2020-03-30 2023-01-13 ***通信集团设计院有限公司 基于区块链的NB-IoT中终端交易处理方法及装置
CN114666327B (zh) * 2020-12-23 2023-12-19 富泰华工业（深圳）有限公司 基于区块链交易的区块打包方法、装置及电子设备
CN112910982B (zh) * 2021-01-27 2023-06-16 网易（杭州）网络有限公司 一种联盟链的节点准入方法、装置、电子设备及存储介质
CN113032489B (zh) * 2021-03-29 2023-07-21 湖北央中巨石信息技术有限公司 一种基于区块链的异步共识方法及***及装置及介质
CN113364871B (zh) * 2021-06-07 2022-05-17 杭州溪塔科技有限公司 一种基于智能合约的节点选举方法、装置及电子设备
CN113364874B (zh) * 2021-06-09 2022-06-10 网易（杭州）网络有限公司 基于区块链的节点同步方法、装置、存储介质及服务器
CN113518005B (zh) * 2021-06-22 2021-11-16 腾讯科技（深圳）有限公司 一种区块共识方法、装置、设备及存储介质
CN113596174B (zh) * 2021-08-06 2022-02-18 环球数科集团有限公司 一种区块链节点部署与选举的装置
CN113726758A (zh) * 2021-08-25 2021-11-30 百保(上海)科技有限公司 基于区块链的数据隐私计算方法及***
CN114189522B (zh) * 2021-10-15 2024-04-16 敏博科技(武汉)有限公司 一种车联网中基于优先级的区块链共识方法及***
CN114124961A (zh) * 2021-11-02 2022-03-01 杭州复杂美科技有限公司 区块确认方法、计算机设备和存储介质
CN114362963B (zh) * 2022-01-07 2024-06-18 南京市中西医结合医院 一种基于算力证明的治未病场景下联盟链主节点选举方法
CN114422155B (zh) * 2022-03-30 2022-08-02 杭州趣链科技有限公司 提案共识执行方法、区块链***、设备和存储介质
CN114884617B (zh) * 2022-05-07 2023-12-26 深圳北宸博裕科技有限公司 区块传输方法、计算机设备和存储介质
CN115412419B (zh) * 2022-08-29 2024-05-14 福建乐摩物联科技有限公司 一种自组网主节点选举及数据同步方法
CN118041839A (zh) * 2022-11-11 2024-05-14 腾讯科技（深圳）有限公司 一种多区块链数据处理方法、装置、设备、介质及产品

Family Cites Families (26)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10304143B2 (en) * 2016-05-05 2019-05-28 Lance Timothy Kasper Consensus system for manipulation resistant digital record keeping
CN105681301B (zh) * 2016-01-16 2019-03-12 杭州复杂美科技有限公司 区块链上的结算方法
CN106228446B (zh) * 2016-05-12 2019-09-13 北京众享比特科技有限公司 基于私有区块链的资产交易平台***及方法
US10204341B2 (en) * 2016-05-24 2019-02-12 Mastercard International Incorporated Method and system for an efficient consensus mechanism for permissioned blockchains using bloom filters and audit guarantees
US10360191B2 (en) * 2016-10-07 2019-07-23 International Business Machines Corporation Establishing overlay trust consensus for blockchain trust validation system
US10621510B2 (en) * 2016-11-09 2020-04-14 Cognitive Scale, Inc. Hybrid blockchain data architecture for use within a cognitive environment
CN106850536B (zh) * 2016-11-30 2020-01-07 北京瑞卓喜投科技发展有限公司 区块链共识方法及***
CN106603698A (zh) * 2016-12-28 2017-04-26 北京果仁宝科技有限公司 基于dpos的区块链共识方法和节点
KR101837169B1 (ko) * 2016-12-29 2018-03-09 주식회사 코인플러그 영지식 증명 알고리즘을 사용하여 머클 트리 구조의 블록체인 기반 비밀 전자 투표 서비스를 제공하기 위한 방법, 및 이를 이용한 투표 코인 발행 서버, 투표 토큰 분배 서버 및 투표 지원 서버
CN106878071B (zh) * 2017-01-25 2020-09-15 上海钜真金融信息服务有限公司 一种基于Raft算法的区块链共识机制
EP3583530B1 (en) * 2017-02-17 2022-10-19 Nokia Technologies Oy Voting-consensus distributed ledger
CN106920167A (zh) * 2017-02-24 2017-07-04 北京航空航天大学 一种基于p2p金融的区块链机制与共识算法
JP6940182B2 (ja) 2017-03-03 2021-09-22 日本電気株式会社 ブロックチェーン管理装置、ブロックチェーン管理方法及びプログラム
CN108241968B (zh) * 2017-03-26 2020-08-14 杭州复杂美科技有限公司 前置机参与区块链共识的方法
US11095432B2 (en) * 2017-04-05 2021-08-17 Samsung Sds Co., Ltd. System for processing data based on blockchain and operating method thereof
CN107341660B (zh) * 2017-05-27 2021-06-29 唐盛（北京）物联技术有限公司 一种区块链底层共识机制以及基于该共识机制的区块链***
CN107301600B (zh) * 2017-06-23 2021-07-20 北京天德科技有限公司 一种跨链交易的区块链互联网模型的核心构建方法
CN107248076A (zh) * 2017-06-24 2017-10-13 北京天德科技有限公司 一种双链式跨链交易的区块链互联网模型的核心算法
CN107423962A (zh) * 2017-07-11 2017-12-01 成都励睿德企业管理有限公司 基于奖惩的数据区块链授权参与共识的拜占庭容错方法及其奖惩方法
KR101877850B1 (ko) * 2017-07-21 2018-07-13 김홍수 블록체인을 이용한 옐로우 페이지 기반 통화 서비스 제공 방법
EP4120620A1 (en) * 2017-12-08 2023-01-18 Ping Identity Corporation Methods and systems for recovering data using dynamic passwords
CN108134706B (zh) 2018-01-02 2020-08-18 中国工商银行股份有限公司 区块链多活高可用***、计算机设备以及方法
CN108108487B (zh) * 2018-01-10 2019-11-22 杭州复杂美科技有限公司 一种区块链的共识方法
CN108416593B (zh) * 2018-03-20 2021-02-12 杨鉴 一种基于网络分散度证明的区块链共识方法和***
CN109165945B (zh) * 2018-09-07 2021-04-16 腾讯科技（深圳）有限公司 代表节点设备选举方法、装置、计算机设备及存储介质
US11347809B2 (en) * 2018-11-13 2022-05-31 Adobe Inc. Performing attribution modeling for arbitrary analytics parameters

Also Published As

Publication number Publication date
EP3848875A1 (en) 2021-07-14
EP3848875A4 (en) 2021-10-27
CN109165945A (zh) 2019-01-08
SG11202011173XA (en) 2020-12-30
US11792006B2 (en) 2023-10-17
JP2021524967A (ja) 2021-09-16
JP6990329B2 (ja) 2022-01-12
KR20200140897A (ko) 2020-12-16
KR102444468B1 (ko) 2022-09-16
EP3848875C0 (en) 2023-07-12
US20210021419A1 (en) 2021-01-21
CN109165945B (zh) 2021-04-16
WO2020048436A1 (zh) 2020-03-12

Similar Documents

Publication Publication Date Title
EP3848875B1 (en) Method, device, computer apparatus and storage medium for electing representative node apparatus
CN110383279B (zh) 用于检测重放攻击的***和方法
CN110431577B (zh) 用于检测重放攻击的***和方法
US10681083B2 (en) System and method for detecting replay attack
US11823178B2 (en) Optimization of high volume transaction performance on a blockchain
US10735464B2 (en) System and method for detecting replay attack
EP3848876A1 (en) Election method and apparatus for representative node device, computer device, and storage medium
KR20210002574A (ko) 데이터 백업 방법, 저장 매체 및 컴퓨팅 기기
WO2018228973A1 (en) Improved hardware security module management
WO2018228974A1 (en) Expendable cryptographic key access
US20210021412A1 (en) Method and apparatus for electing representative node device, computer device, and storage medium
US20200210407A1 (en) Data verification method, apparatus, and system and device
US20210303633A1 (en) Shard hashing
Qin et al. Applying private information retrieval to lightweight bitcoin clients
CN111163148B (zh) 一种区块链***的共识状态的同步方法及相关设备
CN113449342B (zh) 一种基于区块链的随机数预言机实现方法、设备及介质
WO2019243235A1 (en) Distributed ledger technology
CN115310137A (zh) 一种智能结算***的保密方法及相关装置
CN114757777A (zh) 用于区块链的最优链路选择方法及装置和电子设备
CN111695132A (zh) 基于业务数据区块链的投票数据存储方法及***
CN117057807B (zh) 基于区块链架构的资源处理方法及相关设备
Yuan et al. AME Blockchain: An Architecture Design for Closed-Loop Fluid Economy Token System
US12013830B2 (en) System and method using bloom filters to improve system reliability
RU2750642C2 (ru) Система и способ регистрации уникального идентификатора мобильного устройства
US20230138816A1 (en) System and method to reach consensus in a multi-chain iot environment

Legal Events

Date Code Title Description
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE

PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20201026

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

A4 Supplementary search report drawn up and despatched

Effective date: 20210917

RIC1 Information provided on ipc code assigned before grant

Ipc: H04L 29/06 20060101ALI20210914BHEP

Ipc: H04L 9/32 20060101AFI20210914BHEP

RA4 Supplementary search report drawn up and despatched (corrected)

Effective date: 20210922

DAV Request for validation of the european patent (deleted)
DAX Request for extension of the european patent (deleted)
RAP3 Party data changed (applicant data changed or rights of an application transferred)

Owner name: TENCENT TECHNOLOGY (SHENZHEN) COMPANY LIMITED

REG Reference to a national code

Ref country code: DE

Ref legal event code: R079

Ref document number: 602019032777

Country of ref document: DE

Free format text: PREVIOUS MAIN CLASS: G06Q0020380000

Ipc: H04L0009320000

Ref country code: DE

Ref legal event code: R079

Free format text: PREVIOUS MAIN CLASS: G06Q0020380000

Ipc: H04L0009320000

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: GRANT OF PATENT IS INTENDED

RIC1 Information provided on ipc code assigned before grant

Ipc: H04L 9/40 20220101ALI20230127BHEP

Ipc: H04L 9/00 20060101ALI20230127BHEP

Ipc: H04L 9/32 20060101AFI20230127BHEP

INTG Intention to grant announced

Effective date: 20230301

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE PATENT HAS BEEN GRANTED

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602019032777

Country of ref document: DE

U01 Request for unitary effect filed

Effective date: 20230714

U07 Unitary effect registered

Designated state(s): AT BE BG DE DK EE FI FR IT LT LU LV MT NL PT SE SI

Effective date: 20230724

U20 Renewal fee paid [unitary effect]

Year of fee payment: 5

Effective date: 20230914

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20230921

Year of fee payment: 5

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG9D

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20231013

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20230712

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20231112

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: RS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20230712

Ref country code: NO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20231012

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20231112

Ref country code: HR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20230712

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20231013

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20230712

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20230712

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602019032777

Country of ref document: DE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SM

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20230712

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20230712

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20230712

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20230712

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MC

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20230712

26N No opposition filed

Effective date: 20240415