WO2019199205A1 - Procédé de mise à l'échelle d'un système d'informations réparti - Google Patents

Procédé de mise à l'échelle d'un système d'informations réparti Download PDF

Info

Publication number
WO2019199205A1
WO2019199205A1 PCT/RU2019/000213 RU2019000213W WO2019199205A1 WO 2019199205 A1 WO2019199205 A1 WO 2019199205A1 RU 2019000213 W RU2019000213 W RU 2019000213W WO 2019199205 A1 WO2019199205 A1 WO 2019199205A1
Authority
WO
WIPO (PCT)
Prior art keywords
recipient
transaction
node
subchain
sabchain
Prior art date
Application number
PCT/RU2019/000213
Other languages
English (en)
Russian (ru)
Inventor
Максим Михайлович МИХАЙЛЕНКО
Игорь Олегович БЕЛОУСОВ
Original Assignee
Максим Михайлович МИХАЙЛЕНКО
Игорь Олегович БЕЛОУСОВ
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 Максим Михайлович МИХАЙЛЕНКО, Игорь Олегович БЕЛОУСОВ filed Critical Максим Михайлович МИХАЙЛЕНКО
Publication of WO2019199205A1 publication Critical patent/WO2019199205A1/fr

Links

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/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
    • 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/22—Payment schemes or models
    • 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
    • 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
    • G06Q2220/00—Business processing using cryptography

Definitions

  • the invention relates to the field of digital data processing using electrical devices, in particular to digital computing or data processing methods designed for specific functions, including information retrieval, as well as database structuring for this purpose.
  • a hash is a sequence of characters formed by using a mathematical function, which consists in converting input data of an arbitrary length into an (output) line of a fixed, shorter length. With any change in the input data, the hash of this data will be different from the hash of unchanged input data.
  • Blockchain is a data structure consisting of data blocks in which each block (except the first) has a hash of the block created by the previous one. A certain “chain” of blocks is created where each next block is “connected” (has a link to a hash) with the previous block. This structure ensures that if even one bit in the data block changes, its hash will change, which means that the link to the changed block in the next block will not coincide with the new hash. Break will happen chains, which is easily found with a simple check (here you can insert pictures almost everywhere)
  • a blockchain network is a set of nodes with the same blockchain software implementation, which have one more identical software that allows them to communicate with each other through communication channels, exchange blocks and create new blocks.
  • Subchain is a blockchain network, the software of which provides for the possibility of interaction with other blockchain networks through communication channels having the same software.
  • Sidechain is a blockchain network, the software of which provides the ability to interact with the main (parent) blockchain network.
  • Sidechain model a model of interaction between blockchain networks, the main (parent) blockchain network and sidechains.
  • Node - a computer that has means of communication with other computers on which the software runs with some kind of blockchain.
  • the Merkle tree is a complete binary tree, in the leaf vertices of which hashes from data blocks are placed, and the inner vertices contain hashes from adding values in child vertices.
  • the confirmation of the Merkle tree is one branch of the full Merkle tree of the block, in which there is information about only one transaction (the confirmation of which is generated), and all other vertices contain only hashes from neighboring branches.
  • Verification methods as a result of which it can be unambiguously confirmed that the data in question does not contain errors or forgery.
  • a method for verifying a transaction already entered into a block by its MTP First, the correspondence of the information contained in the transaction of the user's signature is checked, then the hash of the transaction is calculated and checked whether it matches what is specified in the MTP, then all the following hash pairs are calculated and their compliance with the data in the MTP is checked, up to the root hash of the block. Then the validity of the block hash is checked.
  • Block validity is a way to check the block hash, confirming that this block belongs to the blockchain of the corresponding sacchain and was created in the consensus process of this subchain. For verification, it is enough to check all the digital signatures of the block hash provided by the subchain nodes. If all signatures belong to the nodes that at that time participated in the consensus on the creation of this block, then the hash of the block passed the check.
  • a digital signature is a small sequence of characters that, using cryptographic transformations, unambiguously allows you to determine that it was used for signing information and the user's private key signing this information.
  • Consensus is a way of interactions between nodes in a blockchain network (participants), as a result of which a new block is created.
  • Digital value is a record with data in the blockchain, which has an owner. The possession of such data is easily verified using software that implements the ability to work with the blockchain, in which the possession of digital values is possible.
  • a double waste is the actions of an attacker, in which information about the transfer of digital value that has already been transferred earlier is proposed for recording in the new block of the blockchain.
  • a new amount of unsecured values appears in the blockchain.
  • Scalability the ability of a system to cope with an increase in workload (increase its productivity) when adding resources. Distinguish between vertical and horizontal scaling.
  • Decentralization is the process of transferring decision-making rights from a single decision-making structure to more numerous dispersed or distributed structures.
  • a single node adoption making decentralized systems as low as possible
  • such a system is called centralized.
  • nodes are added to the system, the failure of which does not lead to the termination of the system, a decentralization process takes place.
  • this is information generated by the user for writing on the blockchain.
  • it may contain an instruction to re-register the value from one owner to another.
  • the authenticity of the order is ensured by the user signing this information with a digital signature of the user
  • User address is a small sequence of characters that is directly related to the user's public key. This connection can be created using cryptographic functions as well as other actions (for example, a user’s address can be just a public key of a user).
  • the way the user address is associated should be easily verifiable. For example, a public key hash is one way to communicate this. It is easy to establish that when changing even one bit in an open key, the address will also change.
  • a single user address space is a requirement for subchains.
  • all subchains use the same way of communication between the user's address and his public key; Subchains have a way of searching and finding a user's subchain, provided that the user's address is known.
  • P2P structure is the structure of a computer network based on the equal rights of participants. In such a structure, each computer is both a client (receives data for its needs from servers) and a server (sends data to other users). Unlike the classical client-server architecture, this structure allows you to maintain the operability of the communication network with any number and any combination of available nodes.
  • SPV is a simplified payment verification
  • the data structure in the blockchain described in US20160330034A1 is used to confirm the fact of blocking digital values in one blockchain network for their subsequent transfer to another blockchain network.
  • IBC Inter-blockchain Communication
  • Inter-blockchain Communication a protocol by which a data packet is transferred from one blockchain network to another via the Cosmos Hub in the Cosmos project.
  • the described system allows you to create a lot of sidechains around the parent blockchain, which, working independently from each other, can transfer values created inside the parent blockchain to each other through the parent blockchain (Fig. 1).
  • the method describes only the transfer of values from the parent blockchain to the sidechain and then the return of these values back.
  • the method does not include work with non-financial transactions. Also, the possibility of sidechains to transfer their values to the parent blockchain or other sidechains is not provided.
  • the indicated method also uses the model shown in Fig. 1, but uses it primarily for scaling: 1. All the main actions take place in sidechains, called “zones” in this project.
  • Parent blockchain (Cosmos hub is named in this method) is used for the most part only as a guarantor for transferring transactions (both value and other) between zones (Fig. 2).
  • Fig. 2 guarantor for transferring transactions (both value and other) between zones (Fig. 2).
  • htps //raw.githubusercontent.com/gnuclear/atom-whitepaper / master / images / hub_and_zones.png - drawing from the project).
  • the problem is that when you capture most of the nodes in the blockchain network, from a person who has access to most of the nodes in the blockchain network, it is possible to produce double spending.
  • the essence of the way of using sidechains, proposed in the indicated technical solution, is based on the fact that the central (main parent) blockchain has much greater security compared to sidechains due to greater decentralization.
  • sidechains who cannot “trust” each other due to security problems due to low decentralization can “trust” the central blockchain and use it as
  • the disadvantages of this method is that any inter-zone transaction must go through the Cosmos HUB, which increases the time of inter-zone transactions by several times relative to intra-zone ones.
  • the time of the inter-zone transaction will be equal to the sum of the times of registration of the transaction in the source zone, registration of the fact of the transaction in Cosmos HUB, registration in the recipient zone.
  • the present invention is intended to solve the technical problem of enabling horizontal scaling of a distributed information system consisting of blockchain networks by increasing the overall performance of this system by adding an unlimited number of blockchain networks to the system.
  • the technical result consists in providing the possibility of forming multi-level structures from peer-to-peer interacting blockchain networks acting as separate cells for next-level networks.
  • the block validation algorithm is the same in all subchains (firstly, it allows you to relatively quickly and reliably validate the block from another subchain, due to the unified block validation algorithm common to all subchains; secondly, it allows nodes to leave the same subchain and enter to another subchain by removing the entire old subchain from the blockchain node and uploading the whole new subchain to the node of the other blockchain; thirdly, it allows the nodes to merge to create a new subchain);
  • Each subchain node has a complete picture of the structure of all other subchains due to the fact that each subchain node contains information about the addresses of all other nodes and their affiliation to the subchains. This allows any node to easily validate the received block or packet with data from other subchains. Each node also has the same mechanism for obtaining information about changes in these structures;
  • Subchains due to the fulfillment of the requirements of paragraph 3, can be combined into a two-level p2p structure (Fig. 1).
  • the total throughput of such a structure will be equal to the sum of the throughputs of all participating subchains.
  • Communication between subchains is of two types.
  • the first type is the transfer of transactions from one subchain to another via the standard protocol for this method (clause 3)
  • the second type of interaction is maintaining a generalized register of all nodes (blockchain subchains) and their organization into subchains.
  • blockchain subchains To maintain this registry, the same consensus method is used as in the blockchain network, only subchains are used as consensus participants (in order for the subchain to vote for validation of the block for consensus between subchains, you must provide confirmation that inside the subchain voice confirmation was recorded in the block of this subchain and validated by the nodes included in it).
  • transactions from one sub-chain of the 1st level are also directly transferred to the recipient of the sub-chain of the 1st level, while the approval of the node registry goes through multi-level validation.
  • the number of nodes in the subchain can be any, but the rule must be observed according to which it is possible to reduce the number of nodes only to a safe minimum. For each specific situation, depending on the field of activity of the enterprise for which the claimed method is used, the safe minimum may be different. However, a balance must be struck between decentralization, efficiency and responsibility of nodes.
  • the essence of the claimed for registration in this application method is as follows: The user who sends the transaction signs the transaction by applying a cryptographic function to the transaction and its own private key (a mechanism similar to the operation of digital signature), which results in a transaction signature. After that, the user who sends the transaction sends the transaction and the transaction signature to the subchain node through the communication channel (for example, via the Internet).
  • the Sabchain node through communication channels with other Sabchain nodes, transfers the transactions received by it and the transaction signatures of the users of the transaction senders to other nodes of the Sabchain for inclusion by the Sabchain nodes of the transactions sent by this Sabchain node of the transactions and the transaction signatures of the users of the transaction senders in a new data block.
  • all transactions where the user-recipient of the transaction is registered in the wrong sub-chain in which the user-sender of the transaction is registered are allocated in a separate section of the new data block. Thus, two sections are created in the new data block:
  • the nodes After a new block is included in the sender subchain blockchain, the nodes extract all transactions from their MTP from the 2nd section of this block. Then the node forms outgoing transaction packets with their MTP for each recipient recipient. Each transaction package with their MTP contains the number of the package for the recipient sub-chain, the address of the recipient sub-chain, the header of a new data block, as well as transactions from their MTP.
  • the nodes included in the sender’s subchain transmit over the communication channels all the generated packets at least to one of the recipient’s subchain nodes.
  • the nodes of the Sabchain recipients of packets with transactions with their MTP Upon receipt by the nodes of the Sabchain recipients of packets with transactions with their MTP from the sending sabchain, the nodes of the Sabchain recipients of packets with transactions with their MTP first check the number of each transaction packet with their MTP by correlating the number of the received packet with the transactions with their MTP with the number of the previous registered transaction package with their MTP, and if the number of the received package with transactions with their MTP is 2 or more than the number of the previous transaction packet receiver registered in the subchain with their MTP, recipient subchain nodes direct these received packets with transactions from their MTP to the waiting queue for missed transaction packets from their MTP, which, in turn, as the missing transaction packets arrive from their MTP, go to the next stage.
  • the packet with the next packet number after the recipient previously registered in the subchain is validated by the subchain-recipient nodes by validating all transactions contained in the packet with their MTP.
  • the transaction package with their MTP is included in the new recipient subchain block, and the balances of user-recipient transactions from the transaction package with their MTP are changed in accordance with these transactions.
  • the recipient’s subchain sends via the communication channels to the sender’s subchain the information about entering the transaction packet from their MTP into the new data block of the recipient’s subchain from the MTP of the transaction packet from
  • the sender's subchain node validates the MTP of the transaction packet from their MTP. If validation is carried out by the sender’s Sabchain node, information about entering the transaction packet from their MTP into a new data block of the recipient’s Sabchain from the MTP of the transaction packet from their MTP is entered into the new sender’s Sabchain block. This completes the work of registering a user’s transaction.
  • the sender’s Sabchain node If the sender’s Sabchain node has not received information on entering the transaction packet from their MTP into the new recipient’s Sabchain data block from the MTP of the transaction packet from their MTP via the communication channels for the time specified by the blockchain network settings, the sender’s Sabchain node re-sends the transaction packet with their MTP to the address of the recipient sabchain node. This continues until the sender’s Sabchain node receives, through communication channels, information about the introduction of the transaction packet from their MTP into the new data block of the recipient’s Sabchain from the MTP of the transaction packet from their MTP.
  • the described method will help in the logistics industry. Take a company that has several warehouses. To prevent cases of substitution of goods or changing data on deliveries retroactively, the management decided to use the blockchain. Using our method, all warehouses can be represented as subchains. In these subchains everything that happens inside their respective warehouses is fixed. And logistic movements between warehouses are executed in the form of intersubschain transactions.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Business, Economics & Management (AREA)
  • Accounting & Taxation (AREA)
  • Strategic Management (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

L'invention concerne le domaine de traitement de données numériques au moyen de dispositifs électriques et notamment des procédés de calculs numériques ou de traitement des données destinés à des fonctions spécifiques, y compris pour la recherche d'informations et la structuration de bases de données à cet effet. Le résultat technique consiste à assurer la possibilité de formation de structures à niveaux multiples à partir de réseaux de chaîne de blocs à interfonctionnement qui agissent comme des cellules isolées pour les réseaux de niveau suivant. Le procédé de mise à l'échelle d'un système d'informations réparti consiste à former une transaction, la signer, l'envoyer à un noeud de sous-chaîne où elle est incluse dans un nouveau bloc, après quoi on l'intègre à une nouveau bloc de données de sous-chaîne du destinataire, après quoi on transmet depuis la sous-chaîne du destinataire des informations sur la confirmation de la réception des transactions à la sous-chaîne du destinataire, et ces informations sont insérées dans le nouveau bloc de données de la sous-chaîne de l'expéditeur. Le procédé de l'invention peut s'utiliser dans l'organisation de l'échange de données dans des entreprises fonctionnant des sphères de la logistique, des entreprises commerciales robotisées, le secteur bancaire ou dans d'autres domaines.
PCT/RU2019/000213 2018-04-14 2019-04-05 Procédé de mise à l'échelle d'un système d'informations réparti WO2019199205A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
RU2018113535A RU2686818C1 (ru) 2018-04-14 2018-04-14 Способ масштабирования распределенной информационной системы
RU2018113535 2018-04-14

Publications (1)

Publication Number Publication Date
WO2019199205A1 true WO2019199205A1 (fr) 2019-10-17

Family

ID=66430607

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/RU2019/000213 WO2019199205A1 (fr) 2018-04-14 2019-04-05 Procédé de mise à l'échelle d'un système d'informations réparti

Country Status (2)

Country Link
RU (1) RU2686818C1 (fr)
WO (1) WO2019199205A1 (fr)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20220321326A1 (en) 2019-06-05 2022-10-06 Mastercard International Incorporated Security model for distributed computing system
EP3816915A1 (fr) 2019-11-04 2021-05-05 Mastercard International Incorporated Surveillance dans un système informatique distribué
CN111125131B (zh) * 2019-12-16 2023-06-06 武汉大学 一种具备状态缓冲能力的两级共识区块链系统及部署方法

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160330034A1 (en) * 2015-05-07 2016-11-10 Blockstream Corporation Transferring ledger assets between blockchains via pegged sidechains
WO2017161417A1 (fr) * 2016-03-21 2017-09-28 National Ict Australia Limited Exécution de processus commercial sur une plateforme de chaîne de blocs
US20170337534A1 (en) * 2015-11-06 2017-11-23 Cable Television Laboratories, Inc Systems and methods for blockchain virtualization and scalability
US20180039667A1 (en) * 2016-08-05 2018-02-08 Chicago Mercantile Exchange Inc. Systems and methods for blockchain rule synchronization
US20180129957A1 (en) * 2016-11-09 2018-05-10 Cognitive Scale, Inc. Cognitive Session Graphs Including Blockchains
US20180144114A1 (en) * 2011-08-09 2018-05-24 Michael Stephen Fiske Securing Blockchain Transactions Against Cyberattacks

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10490304B2 (en) * 2012-01-26 2019-11-26 Netspective Communications Llc Device-driven non-intermediated blockchain system over a social integrity network
US9398018B2 (en) * 2014-03-18 2016-07-19 nTrust Technology Solutions Corp. Virtual currency system
US20170264428A1 (en) * 2016-03-08 2017-09-14 Manifold Technology, Inc. Data storage system with blockchain technology
EP3455802A1 (fr) * 2016-05-13 2019-03-20 De La Rue International Limited Procédés et systèmes pour traiter des actifs
RU2649788C1 (ru) * 2016-06-16 2018-04-04 Общество С Ограниченной Ответственностью "Яндекс" Способ и система для обработки запроса на транзакцию в распределенных системах обработки данных

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180144114A1 (en) * 2011-08-09 2018-05-24 Michael Stephen Fiske Securing Blockchain Transactions Against Cyberattacks
US20160330034A1 (en) * 2015-05-07 2016-11-10 Blockstream Corporation Transferring ledger assets between blockchains via pegged sidechains
US20170337534A1 (en) * 2015-11-06 2017-11-23 Cable Television Laboratories, Inc Systems and methods for blockchain virtualization and scalability
WO2017161417A1 (fr) * 2016-03-21 2017-09-28 National Ict Australia Limited Exécution de processus commercial sur une plateforme de chaîne de blocs
US20180039667A1 (en) * 2016-08-05 2018-02-08 Chicago Mercantile Exchange Inc. Systems and methods for blockchain rule synchronization
US20180129957A1 (en) * 2016-11-09 2018-05-10 Cognitive Scale, Inc. Cognitive Session Graphs Including Blockchains

Also Published As

Publication number Publication date
RU2686818C1 (ru) 2019-04-30

Similar Documents

Publication Publication Date Title
Huang et al. Drugledger: A practical blockchain system for drug traceability and regulation
US20230421355A1 (en) Systems and methods for storage, generation and verification of tokens used to control access to a resource
US20230410215A1 (en) Cryptographic method and system for secure extraction of data from a blockchain
US20220114564A1 (en) Method and system for efficient transfer of cryptocurrency associated with a payroll on a blockchain that leads to an automated payroll method and system based on smart contracts
JP6877448B2 (ja) 分散ハッシュテーブル及びブロックチェーンを用いてコンピュータソフトウェアを保証する方法及びシステム
CN108833081B (zh) 一种基于区块链的设备组网认证方法
US20230028606A1 (en) Method and apparatus for vertical federated learning
CN108615148B (zh) 一种基于区块链技术的担保资产前置交易方法及系统
US11270030B2 (en) System and method for consensus management
CN108200208B (zh) 基于云计算的物流区块链共识算法
WO2021204044A1 (fr) Correction de données de chaîne de blocs
Jani Smart contracts: Building blocks for digital transformation
CN111754343A (zh) 隐私保护的死锁解除
WO2019199205A1 (fr) Procédé de mise à l'échelle d'un système d'informations réparti
CN110766551A (zh) 一种基于改进Kafka共识机制的联盟链及交易方法
CN111327426A (zh) 数据共享方法及相关装置、设备及系统
Garcia Bringas et al. BlockChain platforms in financial services: current perspective
CN115277122A (zh) 基于区块链的跨境数据流动与监管系统
Obushnyi et al. Blockchain as a transaction protocol for guaranteed transfer of values in cluster economic systems with digital twins
US20210374214A1 (en) Method and system for securing computer software using a distributed hash table and a blockchain
CN110727735B (zh) 基于区块链技术协作完成任务事件的方法、装置及设备
Pupyshev et al. SuSy: A blockchain-agnostic cross-chain asset transfer gateway protocol based on gravity
US11973857B2 (en) Data archive
Haga et al. IoT‐Based Autonomous Pay‐As‐You‐Go Payment System with the Contract Wallet
Yamamoto et al. Examination on interoperability of blockchains by using ZK-rollups

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: 19785043

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 19785043

Country of ref document: EP

Kind code of ref document: A1