WO2020058655A1 - Prise de décision collaborative de groupe par des nœuds de réseau décentralisés - Google Patents

Prise de décision collaborative de groupe par des nœuds de réseau décentralisés Download PDF

Info

Publication number
WO2020058655A1
WO2020058655A1 PCT/GB2018/052673 GB2018052673W WO2020058655A1 WO 2020058655 A1 WO2020058655 A1 WO 2020058655A1 GB 2018052673 W GB2018052673 W GB 2018052673W WO 2020058655 A1 WO2020058655 A1 WO 2020058655A1
Authority
WO
WIPO (PCT)
Prior art keywords
nodes
node
decentralized network
ledger
trusted
Prior art date
Application number
PCT/GB2018/052673
Other languages
English (en)
Inventor
Igor Chugunov
Eugeniy BUTYAEV
Original Assignee
Cs Solutions Technology Limited
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 Cs Solutions Technology Limited filed Critical Cs Solutions Technology Limited
Priority to PCT/GB2018/052673 priority Critical patent/WO2020058655A1/fr
Publication of WO2020058655A1 publication Critical patent/WO2020058655A1/fr

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/16—Error detection or correction of the data by redundancy in hardware
    • G06F11/18—Error detection or correction of the data by redundancy in hardware using passive fault-masking of the redundant circuits
    • G06F11/182—Error detection or correction of the data by redundancy in hardware using passive fault-masking of the redundant circuits based on mutual exchange of the output between redundant processing components
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/16—Error detection or correction of the data by redundancy in hardware
    • G06F11/1629—Error detection by comparing the output of redundant processing systems
    • G06F11/165—Error detection by comparing the output of redundant processing systems with continued operation after detection of the error
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/64—Protecting data integrity, e.g. using checksums, certificates or signatures
    • 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

Definitions

  • This invention relates to the means of collaborative decision-making by heterogeneous nodes in a data transmission network. More particularly, the invention relates to the means of group collaborative decision-making by the nodes of, for example, such network as a decentralized data transmission network for generation and implementation of, for example, blockchain environment for transmitting data or smart contracts.
  • the prior art provides technical solutions that implement group collaborative decision making in the decentralized network.
  • the main principle of the DPoS operation can be expressed as dividing the voting and validating peers (nodes) of the decentralized environment. Thereat, the nodes, which have been nominated in the algorithm as having votes in the voting in the system, have no right to validate the transaction. Consequently, in this case, one subset of nodes (having a right to vote) and the other subset of nodes (having a right to validate transactions) select the third subset, which, in its turn, is vested with a right to generate transaction blocks.
  • the validator nodes shall connect, pass through specific verification conditions and declare their readiness to maintain continuous work, the capability to verify transactions in a timely manner and generate new blocks.
  • a rule is applied pursuant to which every node has a right to come forward as a candidate for a validator node. After that, all the nodes vote for candidates, where a weight of every vote is determined by total assets of the voting node.
  • results of the voting are used as grounds for selecting a limited natural number of candidates, which can be vested with the right to generate new transaction blocks.
  • Specific protocol rules are applied that shall guarantee correct decision-making if a greater part of assets of the nodes, participating in the vote is controlled by honest nodes.
  • Validator nodes selected as a result of voting are mixed in a pseudorandom manner, forming a queue.
  • the mixing is made in such a way that it is impossible to foresee the queue, but it appears identical to all honest nodes of the network.
  • a period of time is set during which each of the validator nodes shall generate one queue block. Every validator node is provided with a limited interval of time.
  • the validator node manages to check new transactions and generate a new block based on the previous one, otherwise (if the validator node fails to manage with the task within the preset period) the performance of this operation is assigned to the next validator node in the queue.
  • the preset time has elapsed the validator nodes are mixed and a new queue is formed.
  • the above-mentioned algorithm is, to a certain extent, a premise for creating this invention, however, it has a number of disadvantages inherent in the currently known solutions that are designed for group collaborative decision-making by the decentralized system nodes, for example, such as insufficient effectiveness of decision-making, inadequate security of decision-making (including the increased exposure to attacks, as it is impossible to select the trusted nodes in a dynamic way), and heavy consumption of power and resources by nodes participating in the procedure, which may have absolutely different computational power, data processing rate and the capacity, for example, to generate and process transactions in the decentralized network for implementation of, for example, blockchain environment or smart contracts environment or any other similar environment that requires collaborative decision making by the nodes in the decentralized network.
  • This invention is created with the purpose to develop absolutely new means facilitating the most effective collaborative decision-making by the nodes in the decentralized network, including at least the utmost security in the course of group collaborative decision-making procedure in the decentralized network, ensuring, for example, the generation and carrying out data transmission transactions, for example, such as cryptocurrency transactions or implementation of the smart contract environment or carrying out the transmission of other currently known types of data.
  • the claimed invention can propose a new conceptual model of making group collaborative decisions by the decentralized network nodes (for example, by users’ devices), acceptable for all decentralized network nodes, based on building a new decentralized ledger and dynamic selection of the trusted nodes, where, for example, trusted nodes can be selected by the speed of response and/or randomly.
  • the transactions from all the decentralized network nodes having up-to-date ledgers are sent to this main node.
  • a trusted node if a trusted node contains transactions that are missing on the main node, then the trusted node sends corresponding transactions to the main node.
  • a transaction includes at least the information on a receiving node and indicates a transfer of the transaction amount from the sending node to the transaction receiving node.
  • a transaction includes information on at least one of the sending node addresses, smart contract address, and parameters required to perform the transaction.
  • Another alternative of the invention further comprises the formation of a vector of transactions to be included in the ledger by means of the main node and sending the above- mentioned vector to all nodes that were nominated as the trusted ones.
  • Another alternative of the invention further comprises the verification of transaction vector at every node nominated as the trusted one, by the ledger of every node nominated as the trusted one.
  • Another alternative of the invention further comprises putting an electronic signature on a transaction vector by each node nominated as the trusted one, upon successful verification.
  • a new writing node serves as a hash generator for a new block.
  • a new writing node distributes the new block to all the nodes in the network.
  • Another alternative of the invention wherein, the selection of a new writing node from the set of nodes nominated as the trusted nodes, where the new writing node has made a positive decision on the block, which is identical with a majority of decisions made by a majority of nodes out of nominated as the tmsted nodes, is performed in a random way.
  • Another alternative of the invention wherein, a node nominated as the main node is selected as the new writing node.
  • Another alternative of the invention wherein, when selecting the preset number of third nodes, the first of them is nominated as the main one.
  • the nodes from a set of the decentralized network nodes, from which no hash has been received within the preset time and/or mismatching hashes have been received may participate in one or more subsequent rounds of collaborative decision-making by the decentralized network nodes.
  • a block is a verified and validated pool of transactions.
  • Another alternative of the claimed invention is a system for collaborative decision making by the decentralized network nodes that comprises a digital decentralized network, including at least one processing device and memory, which contains instructions executed at least by one processing device, and the execution of these instructions by at least one processing device prompts the digital decentralized network to act as follows: create a network with a set of nodes, each of which includes a processor and a data storage; initialize the ledger including the information on at least one transaction confirmed in the course of decision-making by the network nodes; save the said ledger on each of the nodes from the set of nodes of the decentralized network; select at least three nodes from the set of decentralized network nodes subject to participation in the collaborative decision-making procedure where each of the decentralized network node set sends a hash of the last block available on the node to one of at least three nodes that have performed validation and verification of the last transaction pool, and in this case the nodes from the decentralized network node set, from which no hash has been received within the preset time and/or mismatching
  • Another alternative of the invention wherein, if the trusted node contains transactions that are missing on the main node, then the trusted node sends the missing transactions to the main node.
  • a transaction in the decentralized network includes at least information on the receiving node and indicates a transfer of the transaction amount from the sending node to the transaction receiving node.
  • a transaction additionally includes information on at least one of the sending node addresses, smart contract address, and parameters required to perform the transaction.
  • a vector of transactions that are to be included in the ledger by means of the main node is formed in the decentralized network and the said vector is sent to all nodes nominated as the trusted ones.
  • Another alternative of the invention comprises the verification of transaction vector at every node nominated as the trusted one, by the ledger of every node nominated as the trusted one in the decentralized network.
  • Another alternative of the invention comprises putting an electronic signature on a transaction vector by each node nominated as the trusted one, upon successful verification, in the decentralized network.
  • a new writing node serves as a hash generator for a new block in the decentralized network.
  • a new writing node performs verification and signing of a new block in the decentralized network.
  • a new writing node distributes the new block to all the network nodes in the decentralized network.
  • Another alternative of the invention comprises the random selection of a new writing node from the set of nodes nominated as the trusted nodes, where the new writing node has made a positive decision on the block, which is identical with a majority of decisions made by a majority of nodes out of nominated as the trusted nodes in the decentralized network.
  • a node nominated as the main node is selected as a new writing node.
  • Another alternative of the invention wherein, when selecting the preset number of third nodes, the first of them is nominated as the main one in the decentralized network.
  • the nodes from a set of the decentralized network nodes, from which no hash has been received within the preset time and/or mismatching hashes have been received may participate in one or more subsequent rounds of collaborative decision-making by the decentralized network nodes in the decentralized network.
  • the block is a verified and validated pool of transactions.
  • Fig. 1 shows a visual schematic layout of the decentralized network nodes
  • Fig. 2 shows an example of a sequence diagram for determining the nodes appropriate for participation in the collaborative decision-making
  • Fig. 3 shows an alternative diagram of selecting the main and trusted nodes for the collaborative decision-making procedure
  • Fig. 4 shows an alternative diagram of sending transactions from all nodes of the decentralized network to the main one.
  • Fig. 5 gives a schematic view of distributing a vector of transaction-candidates to be added to the trusted nodes ledger
  • Fig. 6 gives a schematic view of exchanging transaction deltas among all trusted nodes
  • Fig.7 gives a schematic view of exchanging transaction delta matrices among all trusted nodes
  • Fig. 8 shows the selection of a new trusted writing node for writing a new block to the ledger.
  • Balance - total currency for example, such as cryptocurrency
  • a wallet of the user of the group collaborative decision-making system for example, of such wallet as the blockchain- wallet.
  • wallet blockchain- wallet
  • wallet is meant a specially configured hardware or software storage of data with a high level of security, which allows the visual indication of dynamic changes in a personal user’s account; by the term“balance” is meant total currency (for example, such as cryptocurrency) in the specified wallet at the current time.
  • a web-wallet, or other types of wallet for example, such as desktop, mobile, hardware, online-wallets or other types of wallets and their modifications can be used as a wallet.
  • block By block is meant a set of transactions that have passed the procedure of collaborative decision-making (consensus) by nodes with a positive result.
  • Blockchain is a decentralized (peer-to-peer) system, which has no central controller, i.e. blockchain is a continuous sequential chain of blocks (linked list of blocks) built pursuant to certain rules, with the blocks containing certain information, and thereat copies of the block chains are stored on multiple different computers of the system users (nodes) independently of each other, so the information contained in the blocks cannot be virtually changed, damaged or falsified.
  • node in the decentralized network is meant an aggregate of the user’s application installed on their electronic device and the up-to-date ledger that is connected with the common system participating in rounds of voting for selection of the main node and trusted nodes, confirming/rejecting transactions and saving them to the special-purpose ledger. Yet, until the ledger is updated by the user’s application, the node cannot be considered as a valid node in the network, i.e. cannot participate in the procedure of selecting the main and tmsted nodes.
  • “common node” as used herein means a node participating in the selection of the main and trusted nodes;“main node” - node of the decentralized network ensuring analysis and confirmation of transactions (white list, i.e. reliable list) as well as adding transactions to a special-purpose ledger;
  • “trusted node” a node ensuring analysis of transactions and compiling a white list of transactions
  • writing node - a node that has written the last block in the previous round and has authorities to initiate a new round
  • node validation a specific process confirming the validity of the node which has the sought-for (necessary and sufficient) resources to ensure the operation of the decentralized network.
  • the term“consensus” as used herein means the execution of the group decision-making procedure by nodes in the decentralized network aimed at generating final decisions acceptable for all the network nodes without exception and by the term“round” is meant a cycle of (federative) voting by the decentralized network nodes on compiling the white list of transactions.
  • Ledger as used herein means the interconnected means and methods of storing necessary data on the transactions (actions) that have been already completed in the decentralized network system, performed in the system for evaluating the value of an environment user’s account, i.e. in general words it can be said that the ledger among other things bears the information on the list of transactions confirmed by the system and saved on all the decentralized network nodes.
  • reaction is meant a minimum unit of the system inherent in the decentralized network system, denoting a request to perform an action in the system and recording the results of such actions in the blockchain.
  • All network nodes in this invention are decentralized and none of them has a priority over the other nodes. Thereat, it is necessary to specify the network node, which will perform the operation of processing a queue of transactions stored on different network nodes. After that, the indicated node shall enter a newly generated block of transactions into the ledger.
  • the platform uses its own combined protocol based on the calculation of the mathematical function of all ledger transactions, applying the Proof of Work principles.
  • the use of specific-purpose ledger allows unambiguous determination of storage of the latest up- to-date copy of the ledger and software at this node (Proof of Capacity), by calculating the checksum of values of the entire contents - the hash code. The size of files is determined as well, as evidence that this is the latest up-to-date copy and the hash-code of the latest transaction recorded in the system.
  • the node searches for the value of the hash function that it calculates based on the last stored ledger.
  • a competitive environment established between all the network nodes provides an opportunity to become the main node on equal terms, to generate and store a new ledger.
  • the result contains a timestamp of the calculation date and a value based on the calculation of the function of the ledger files and software. All nodes receive the calculated value, compare the calculation time allocated for the search of the main network server, verify it and confirm the trust factor of the node, and also confirm its opportunity to participate in the competition to become the main network node.
  • the nodes that correctly calculated the value of the function and contain timestamps are arranged in a list.
  • the SHA-2 algorithm concept may be used.
  • Hash functions of the SHA-2 family are built on the basis of the Merkle-Damgard structure. In this case, those skilled in the art will be able to establish that the above-mentioned algorithm is not a limitative example. It is possible to use any known hashing algorithm.
  • each block may be divided, for example, into a certain number of words, for example, into 16 words.
  • the algorithm passes each message block through a cycle of a set number of iteration (rounds), for example, 64 or 80 rounds, or any other value.
  • the results of each block processing are summarized.
  • the sum is the hash function value.
  • the internal state of the system is initialized based on the results of the previous block processing.
  • the procedure of group decision-making in the decentralized network (consensus) in this invention can be described as the use of a federative model of decision searching - voting of trusted validator nodes.
  • the consensus building algorithm is essentially an algorithm for passage of a finite-state automation.
  • Consensus works by cycles (time steps). Per time step, transactions are extracted from the decentralized network and placed in a pool (one-dimensional array). After being placed in this pool, all transactions are sent to trusted nodes in order to receive a response. If the response is received, then the transaction for which the request to add to the ledger was sent, can be added to the ledger of this validator. After that, the transaction is sent to the next validator in the decentralized network. When consensus is built - at the end of the chain where the transfer legality is fully confirmed, the transaction is sent to validation and marked for writing and saving to the ledger.
  • Fig. 1 shows the visual schematic layout of the decentralized network, where each endpoint represents a network node - the aggregate of the user’s application installed on their electronic devices and the up-to-date ledger that are connected with a common system participating in rounds of voting for selection of the main node and trusted nodes.
  • the node in the decentralized network in this invention is, for example, a user’s computer (for example, of a cryptocurrency platform or a party of smart contract) with installed complete client of the special-purpose system representing a specific software that connects the user’s computer and the decentralized network, including other nodes of the decentralized network. So, the computer by means of the“complete client” is able to verify transactions and write them to the ledger.
  • the user’s computer may be represented by any currently known device of such kind, including but not limited to a personal computer, portable computer, server station, tablet-type computer device, etc.
  • the user’ s computer shall have a reliable connection to the network.
  • This network may be a public network (for example, Internet), a private network (for example, local network (LAN) or a distributed network (WAN)), as well as the combination thereof. Having said that, it shall be apparent to those skilled in the art that any other known types of networks, including but not limited to, for example, GPRS, 3G, 4G/LTE, Wi-Fi, etc., may be applied.
  • an initial ledger For this purpose a node in the decentralized network generates the first transaction, then, when all conditions of a specific action are met, the user, by means of the complete client installed on the user’ s computer, initiates the action in the decentralized network (through the decentralized network platform software, for example, of the blockchain platform or smart contract platform).
  • the kernel of validator keeps track of synchronization and invariance of the latest up-to-date ledger version.
  • the group collaborative decision-making procedure (consensus procedure) can be started by the network nodes.
  • the consensus procedure can be“logically” divided into several stages as described in details below with reference to the drawings.
  • Such“stages” can be as follows:
  • the transaction commission can be calculated and a subset of valid transactions can be extracted from the set of preset transactions
  • Fig. 2 shows the sequence diagram for determining the nodes appropriate for participation in the collaborative decision-making procedure.
  • the main and tmsted nodes are subject to specific requirements, in particular, availability of adequate power in these nodes, i.e., for example, nodes that manage to respond within a preset period of time.
  • the certain preset actions are performed, for example, such as described below initial filtration, for example, by (adequate) node power.
  • Each network node sends the hash (hash in Fig. 2, simply put, the term“hash” means a unique sequence of symbols of a certain kind that is generated on the basis of data) of the very last block, which is available at this node, to one of the nodes from the previous round of the decentralized network platform operation that has written the last block to the blockchain.
  • a preset period of time (for example, but not limited to, from 0.2 to 2.0 seconds inclusive) is given for sending the hash, and the nodes, from which no hash has been received within this time, drop out of the contest for the right to participate in the consensus procedure. In such a way the so-called initial filtration of the nodes by power is performed.
  • the node which has received the said hashes, compares them with the block’s hash that was written by it in the previous round. Then, the nodes which sent the mismatching hashes are isolated (drop out). So, the node with the out-of-date ledger cannot become the main or tmsted node, for example, for the next round.
  • Fig. 3 illustrates the diagram of selecting the main and tmsted nodes for the collaborative decision-making procedure.
  • a list of preset length, for example, n of the nodes with up-to-date ledger (those sent coinciding hashes - description of Fig. 2 above) is generated at the decentralized network platform node, which has written the last block to the blockchain.
  • Each round of the decentralized network platform operation may have a preset number of, for example, m nodes participating in the voting procedure on transactions, i.e. nodes, that can be the trusted and main ones.
  • the indicated number of nodes m shall be equal to such number, that, for example, it shall satisfy the expression of interconnection between m and n nodes, which, for example, can be chosen by way of experiment, therewith, a preset threshold is established for the m value.
  • the preset number of m nodes for example, 3m nodes or any other preset number is selected among n nodes in a random way (for example, by a random number generator).
  • m nodes are selected, the first of which is nominated to be the main node of the next round and the rest of m nodes are nominated as the trusted nodes of the next round.
  • Fig. 4 illustrates the flowchart of sending transactions from all nodes of the decentralized network to the main one (marked in the drawings as node 1).
  • the transaction is generated and stored at the sending node.
  • the transaction contains, for example, information on the user’s actions.
  • the transactions generated during the selection of the main and trusted nodes, as it was mentioned above with reference to Figs. 2 and 3, are sent from all nodes, except the trusted ones, to the main node.
  • main node 1 of the decentralized network platform for s a vector of transaction-candidates to be included in the ledger.
  • the said vector in its turn, is sent by main node 1 to all trusted nodes (in Fig. 4 - nodes 2, 3, m).
  • the said vector of the transaction-candidates may look, for example, as follows:
  • T parameters are the transactions containing information, for example, about the sending node and a transaction number associated with the sending node.
  • each trusted node after receiving the vector of the transaction-candidates to be included in the ledger, verifies each transaction in the indicated vector by its own ledger.
  • each trusted node may calculate and compare, for example, wallet deltas (blockchain wallets), which, for example, denote the balance of the nodes after confirmation of all transaction-candidates for this trusted node.
  • wallet deltas blockchain wallets
  • each trusted node puts a digital signature that is individual for each trusted node (by digital signature may be meant a unique digital signature (for example, a digital stamp), generated, for example, in a random way for each node of the network, that is put by the node on the data).
  • the digital signature is unique for each node and, for example, can be generated for each of the nodes at its connection to the system.
  • the digital signature is an identifier of the node that has made operations with data to the transaction deltas vector and it redirects the transaction deltas vector to all other trusted nodes.
  • each of the trusted nodes After sending the transaction deltas vector (i.e. the difference in data) to the trusted nodes, each of the trusted nodes has a generated transaction delta matrix received from all trusted nodes. Then, the transaction delta matrices are exchanged (as shown in Fig. 7), under the principle analogous to the above-mentioned sending the transaction delta vector to all trusted nodes.
  • the transaction delta matrix containing values of the transactions deltas may look, for example, as follows:
  • each of the tmsted nodes can calculate the“cube of transaction deltas” for making a decision
  • Delta matrices are collected from all trusted nodes, for example, looking as follows:
  • Each trusted node goes through all obtained matrices and generates the vector of the most frequently encountered deltas of the transactions, for example, looking as follows
  • each trusted node is configured to calculate the final vector of majority for each transaction.
  • the said matrix of the delta majority may look, for example, as follows:
  • the majority vector for each transaction may look, for example, as follows:
  • the said vector After calculation of the resulting vector at each trusted node it is already possible to generate the vector containing values of only approved transactions, and in this case, the said vector shall be identical at each honest node.
  • Fig. 8 illustrates the selection of the new trusted writing node for the writing of the new block to the ledger.
  • one of the trusted nodes shall be used, that earlier has made a positive decision on the block, identical to the majority of other tmsted nodes. It can be said that such node is a“guaranteed honest node”.
  • the procedure of isolation of the so-called“traitor nodes” from the number of trusted nodes, that shall be isolated, can be performed, for example, by means of verifying the result of decision-making while determining the majority for each transaction (as described above).
  • the trusted nodes which have made decisions mismatching with the majority’s decision, are excluded from the list of trusted nodes that potentially can write the new block to the ledger. The remaining list will be identical at all honest nodes.
  • Any node is randomly selected from the remaining nodes. This node afterward becomes the new writing node of the block to the blockchain.
  • the new writing node serves as a new block hash generator and writes the new block of the blockchain to the ledger. This very node will distribute the new block among all nodes in the system. After distributing the new blockchain block, a new round (stage) of the system operation starts in the decentralized network platform.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Computer Security & Cryptography (AREA)
  • General Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • Quality & Reliability (AREA)
  • Bioethics (AREA)
  • Software Systems (AREA)
  • Computer Hardware Design (AREA)
  • General Health & Medical Sciences (AREA)
  • Health & Medical Sciences (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

L'invention concerne le moyen de prise de décision collaborative par les nœuds dans un réseau de transmission de données. L'invention est développée pour créer de nouveaux moyens contribuant à la prise de décision collaborative la plus efficace par les nœuds dans le réseau décentralisé, comprenant au moins la plus grande sécurité tout en appliquant la procédure de prise de décision collaborative de groupe dans le réseau décentralisé, qui assure, par exemple, la génération et la performance des transactions, par exemple, telles que des transactions de cryptomonnaie ou la mise en œuvre de l'environnement de contrat intelligent. L'une des variantes de l'invention est le procédé comprenant des étapes au niveau desquelles on effectue les étapes suivantes : créer un réseau ayant un ensemble de nœuds ; initier le registre, qui comprend des informations sur au moins une transaction ; enregistrer ledit registre au niveau de chaque nœud de l'ensemble de nœuds de réseau décentralisés ; sélectionner au moins trois nœuds dans l'ensemble sur des nœuds et envoyer un hachage du dernier bloc disponible sur le nœud par chacun de l'ensemble de nœuds de réseau décentralisés à l'un d'au moins trois nœuds qui ont effectué une validation et une vérification du dernier groupe de transactions, et, dans ce cas, les nœuds de l'ensemble de nœuds de réseau décentralisés, desquels aucun hachage n'a été reçu dans le temps prédéfini et/ou des hachages d'inadéquation ont été reçus, sont exclus de l'ensemble de nœuds soumis à une participation à une prise de décision collaborative dans le réseau décentralisé ; compiler une liste des premiers nœuds à l'aide d'un registre à jour de la longueur prédéfinie au niveau du nœud de l'ensemble de nœuds restants soumis à une participation à une prise de décision collaborative, qui a écrit le dernier bloc ; sélectionner de manière aléatoire, dans la liste de premiers nœuds, un nombre prédéfini de deuxièmes nœuds à l'aide d'un registre à jour, à partir duquel un nombre prédéfini de troisièmes nœuds est sélectionné, le nombre aléatoire étant désigné en tant que nœud principal, et le reste des nœuds des premiers nœuds est désigné en tant que nœuds de confiance ; générer un nouveau bloc qui doit être écrit dans le registre ; sélectionner la nouvelle écriture permettant d'écrire le nouveau bloc dans le registre.
PCT/GB2018/052673 2018-09-19 2018-09-19 Prise de décision collaborative de groupe par des nœuds de réseau décentralisés WO2020058655A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/GB2018/052673 WO2020058655A1 (fr) 2018-09-19 2018-09-19 Prise de décision collaborative de groupe par des nœuds de réseau décentralisés

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/GB2018/052673 WO2020058655A1 (fr) 2018-09-19 2018-09-19 Prise de décision collaborative de groupe par des nœuds de réseau décentralisés

Publications (1)

Publication Number Publication Date
WO2020058655A1 true WO2020058655A1 (fr) 2020-03-26

Family

ID=63878699

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/GB2018/052673 WO2020058655A1 (fr) 2018-09-19 2018-09-19 Prise de décision collaborative de groupe par des nœuds de réseau décentralisés

Country Status (1)

Country Link
WO (1) WO2020058655A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113672987A (zh) * 2021-09-06 2021-11-19 上海万向区块链股份公司 PoW机制下分组式记账节点的选择方法及系统

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150244690A1 (en) 2012-11-09 2015-08-27 Ent Technologies, Inc. Generalized entity network translation (gent)
US9830593B2 (en) 2014-04-26 2017-11-28 Ss8 Networks, Inc. Cryptographic currency user directory data and enhanced peer-verification ledger synthesis through multi-modal cryptographic key-address mapping

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150244690A1 (en) 2012-11-09 2015-08-27 Ent Technologies, Inc. Generalized entity network translation (gent)
US9830593B2 (en) 2014-04-26 2017-11-28 Ss8 Networks, Inc. Cryptographic currency user directory data and enhanced peer-verification ledger synthesis through multi-modal cryptographic key-address mapping

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
ALYSSON BESSANI ET AL: "State Machine Replication for the Masses with BFT-SMART", 2014 44TH ANNUAL IEEE/IFIP INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS, 1 June 2014 (2014-06-01), pages 355 - 362, XP055573588, ISBN: 978-1-4799-2233-8, DOI: 10.1109/DSN.2014.43 *
ANONYMOUS: "Consensus mechanism in CREDITS distributed system - Credits", 13 May 2018 (2018-05-13), XP055573721, Retrieved from the Internet <URL:http://web.archive.org/web/20180513005718/https://medium.com/@credits/consensus-mechanism-17dff891484f> [retrieved on 20190325] *
YOSSI GILAD, ROTEM HEMO, SILVIO MICALI, GEORGIOS VLACHOS, NICKOLAI ZELDOVICH: "Algorand : Scaling Byzantine Agreements for Cryptocurrencies", PROCEEDINGS OF THE 26TH SYMPOSIUM ON OPERATING SYSTEMS PRINCIPLES , SOSP '17, 1 January 2017 (2017-01-01), New York, New York, USA, pages 51 - 68, XP055573405, ISBN: 978-1-4503-5085-3, DOI: 10.1145/3132747.3132757 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113672987A (zh) * 2021-09-06 2021-11-19 上海万向区块链股份公司 PoW机制下分组式记账节点的选择方法及系统
CN113672987B (zh) * 2021-09-06 2023-09-05 上海万向区块链股份公司 PoW机制下分组式记账节点的选择方法及系统

Similar Documents

Publication Publication Date Title
JP7408619B2 (ja) ブロックチェーンネットワークにおいて大規模分散メモリプールを管理するためのコンピュータ実装されたシステム及び方法
US11836720B2 (en) Infinitely scalable cryptocurrency system with fast, secure verification
US11177939B2 (en) Blockchain system including a distributed network of a plurality of nodes and a method for achieving an agreement between the plurality of nodes executed by processors of the block chain system
US11153069B2 (en) Data authentication using a blockchain approach
US11405181B2 (en) Lightweight blockchain based on split-trust
Ismail et al. Towards a blockchain deployment at uae university: Performance evaluation and blockchain taxonomy
US11593321B2 (en) Systems and methods of self-administered protocols on a blockchain platform
CN110771127B (zh) 用于区块链网络中一致分布式内存池的方法和系统
EP4318362A1 (fr) Procédé, appareil et dispositif de traitement de données reposant sur une chaîne de blocs, et support de stockage
JP7319961B2 (ja) 一対の結合ブロックチェーンを構成するバイナリブロックチェーンに関連するコンピュータ実装システム及び方法
US11367055B2 (en) Decentralized pooled mining for enabling proof-of-work on blockchains
Alzahrani et al. A new product anti‐counterfeiting blockchain using a truly decentralized dynamic consensus protocol
CN108347483B (zh) 基于双层网络的去中心化计算系统
WO2020065242A1 (fr) Procédé et système de traitement de transaction dans un réseau décentralisé par des nœuds de réseau dans une prise de décision collaborative
CN113422805B (zh) 一种基于可验证随机函数的分片共识方法
Wang et al. An efficient, secured, and infinitely scalable consensus mechanism for peer-to-peer energy trading blockchain
Masood et al. Consensus algorithms in distributed ledger technology for open environment
WO2020058655A1 (fr) Prise de décision collaborative de groupe par des nœuds de réseau décentralisés
WO2020089567A1 (fr) Formation de groupes parallèle sous prise de décision par des nœuds de réseau décentralisé
KR102130900B1 (ko) 블록체인 시스템에서의 고속 합의 방법
Himanshu An overview of blockchain technology: Architecture and consensus protocols
Guo Cypherium: a scalable and permissionless smart contract platform
Alkhodair et al. Consensus Algorithms of Distributed Ledger Technology--A Comprehensive Analysis
Zhou et al. Overview to Blockchain Scalability Challenges and Solutions
JP7518220B2 (ja) ブロックチェーン・ネットワークのノードに関する方法

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 18788821

Country of ref document: EP

Kind code of ref document: A1

DPE1 Request for preliminary examination filed after expiration of 19th month from priority date (pct application filed from 20040101)
NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 18788821

Country of ref document: EP

Kind code of ref document: A1