CN111447087A - Block chain configuration method for dynamic networking - Google Patents
Block chain configuration method for dynamic networking Download PDFInfo
- Publication number
- CN111447087A CN111447087A CN202010207170.2A CN202010207170A CN111447087A CN 111447087 A CN111447087 A CN 111447087A CN 202010207170 A CN202010207170 A CN 202010207170A CN 111447087 A CN111447087 A CN 111447087A
- Authority
- CN
- China
- Prior art keywords
- network
- consensus
- node
- pbft
- new
- 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.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0803—Configuration setting
-
- 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/08—Network architectures or network communication protocols for network security for authentication of entities
-
- 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/10—Network architectures or network communication protocols for network security for controlling access to devices or network resources
- H04L63/101—Access control lists [ACL]
-
- 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
-
- 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
-
- 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/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
-
- 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/2866—Architectures; Arrangements
- H04L67/30—Profiles
-
- 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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Abstract
The invention relates to the field of block chains, and provides a block chain configuration method for dynamic networking, which comprises the following steps: s1, constructing a PBFT consensus network, wherein the PBFT consensus network is composed of MN nodes; s2, constructing a basic network, wherein the basic network is composed of BN (boron nitride) nodes, participates in the consensus of all PBFT (basic packet transport function) consensus networks, and stores the accounts of all the consensus networks; s3, a node MN in the dynamic PBFT consensus networkXApplying for constructing a new PBFT consensus network to the basic network, confirming whether the node has authority through an intelligent contract by the basic network, and if the node is determined to be the certain node MN by the basic networkXIf qualified, each MN node in the original PBFT consensus network is MN-specificXThe parameters specified in (1) construct a new dynamic network. The method of the invention enables the data to be visible only in a small range, and meanwhile, the initiator can freely designate the blockWhich nodes in the chain are the consensus participants.
Description
Technical Field
The present invention relates to a block chain technology, and more particularly, to a block chain allocation method for dynamic networking.
Background
Blockchain systems are increasingly used in engineering for a wide variety of engineering scenarios, such as: the data storage and source tracing well solves the problem of multi-party trust.
However, in practical use, data privacy is also required between the main parties sharing a blockchain network, and data is not intended to be completely disclosed on the network, or the main parties in common do not have sufficient resources and do not remain online for a long time. While acting as a leader of the data, it is desirable to be able to specify to itself that certain subjects become co-aware participants.
In all of the above situations, the existing single blockchain system cannot meet the requirements, and a new mechanism is needed to ensure the requirements of the user for "data security" and "node free assignment".
Disclosure of Invention
To solve the problems in the background art, the present invention provides a block chain configuration method for dynamic networking, comprising:
s1, constructing a PBFT consensus network, wherein the PBFT consensus network is composed of MN nodes;
s2, constructing a basic network, wherein the basic network is composed of BN (boron nitride) nodes, participates in the consensus of all PBFT (basic packet transport function) consensus networks, and stores the accounts of all the consensus networks;
s3, a certain node MN in PBFT consensus networkXApplying for constructing a new PBFT consensus network to the basic network, confirming whether the node has authority through an intelligent contract by the basic network, and if the node is determined to be the certain node MN by the basic networkXIf qualified, each MN node in the original PBFT consensus network is MN-specificXThe parameters specified in (1) construct a new PBFT consensus network.
The invention provides a block chain architecture method, which enables data to be visible only in a small range, enables an initiator to freely designate which nodes are used as commonly-identified participants, and has the following advantages.
1. A plurality of private group accounts can be established based on one basic PBFT network, and the confidentiality of data is improved.
2. The participating nodes can designate the nodes outside the basic nodes as the consensus nodes, so that the cheating probability of the members of the account book is reduced.
3. Primary nodes in the PBFT network are fixed, the network consensus process is accelerated, and the transaction throughput is improved.
4. Except the basic network node, other nodes can be on line when consensus is needed, and resources are effectively saved.
5. The MN node dynamically establishes a consensus network, so that the mobile terminal can participate in the maintenance of the block chain account book.
Drawings
In order that the invention may be more readily understood, it will be described in more detail with reference to specific embodiments thereof that are illustrated in the accompanying drawings. These drawings depict only typical embodiments of the invention and are not therefore to be considered to limit the scope of the invention.
FIG. 1 is a flow chart of the method of the present invention.
Fig. 2 shows the data processing flow of a network node.
Fig. 3 is a schematic diagram of a network account book.
Fig. 4 is a flow chart of the basic network node response.
Fig. 5 is a protocol diagram of a practical byzantine fault-tolerant algorithm.
Detailed Description
Embodiments of the present invention will now be described with reference to the drawings, wherein like parts are designated by like reference numerals. The embodiments described below and the technical features of the embodiments may be combined with each other without conflict.
Figure 1 shows a flow chart of the method of the invention. As shown in FIG. 1, the method of the present invention includes steps S1-S3.
And S1, constructing a dynamic PBFT (provider-context-based software) consensus network, wherein the PBFT consensus network is composed of MN (member _ net) nodes, the member network only participates in the consensus of the PBFT consensus network where the member network is located, and only stores the account book of the consensus network related to the member network.
PBFT is a practical byzantine fault-tolerant algorithm to ensure system correctness (avoid forking) with fewer than one third of rogue nodes. Compared with the original BFT algorithm, the complexity of the algorithm is reduced from exponential level to polynomial level, so that the practical application of the BFT algorithm is possible. As shown in fig. 2, the intermediate consensus process needs to go through 3 stages from the initiation of a request to the final receipt of a reply:
1) pre-prepare stage: and primary receives the request, generates a new block and broadcasts the new block.
2) The prepare stage: after all replicas receive the block, they broadcast the block verification result while waiting to receive the broadcast from nodes beyond 2/3.
3) And a commit stage: upon receipt of the 2/3 node broadcast or upon a timeout, the broadcast is again sent while again waiting to receive more than 2/3 node broadcasts.
And S2, constructing a basic network, wherein the basic network is composed of BN (base _ net) nodes, participates in the consensus of all dynamic PBFT consensus networks, and simultaneously stores the ledgers of all the consensus networks.
FIG. 2 shows a network request diagram for pbft. Fig. 3 shows a network ledger diagram.
S3, a node MN in the dynamic PBFT consensus networkXApplying for the basic network to construct a PBFT consensus network belonging to the basic network, confirming whether the node has the authority to establish a new PBFT network or not through an intelligent contract by the basic network, and if the basic network determines that the MN is establishedXIf qualified, each node of MN in the original PBFT consensus network will be as MNXThe parameters specified in (1) construct a new dynamic network.
More specifically, the step S1 further includes a step S1-1: the MN node is configured to decide which nodes to accept the established consensus network. Additionally, the MN node is configured to: the consensus of MN nodes can only be one at the same time, namely, only one consensus process can be participated at the same time.
More specifically, step S2 includes steps S2-1 and S2-2.
S2-1, establishing an intelligent contract on the basic network. The intelligent contract realizes the following functions:
1) setting a permission member list: and setting which users have the authority to dynamically establish a PBFT consensus network.
2) Delete rights member list: and deleting the authorized user.
3) And (3) changing the local configuration file: the IP and address of each node on the new consensus network is specified.
4) Create a "consensus thread": and calling a main program to create a 'consensus thread' for the new consensus network so as to participate in the new consensus process.
S2-2, implementing multithreading consensus in the main program of the BN node, wherein the multithreading consensus refers to that: in a main program, the common identification of different common identification networks is independently participated in a multithreading mode. One thread for each consensus network, and the consensus threads do not influence each other.
More specifically, step S3 includes S3-1-S3-6, described in detail below with reference to FIG. 4.
First node MN in S3-1, MN (member _ net) network (i.e. dynamic PBFT consensus network)1To the second node MN2A create request is initiated.
S3-2, second node MN2Making a decision to reply to the first node MN if it agrees1. If agreed, the first node MN1And becoming a newly-identified primary node.
First node MN1Receiving the second MN2If the second node MN replies2Disapproval, network creation terminates; if the second node MN2Agreeing to, the first node MN1Proceed to S3-3.
S3-3, first node MN1Third node BN to any node of BN (base _ net) network (i.e. base network)XSending a request for creating a new consensus network, wherein the request carries a first node MN1And a second node MN2IP address, port.
S3-4, BN (base _ net) network starts own basic consensus, and whether to allow the first node MN or not is decided by a rule preset in an intelligent contract1A new consensus network is created. If the authority authentication fails, immediately returning to the first node MN1A failure result; if the authority authentication is passed, immediately returning to the first nodeMN1And (6) successful results.
S3-5, respective nodes of BN (base _ net) network connect a first node MN1Arranged as primary node of a consensus network and according to a first node MN1And configuring new BFT consensus network parameters by the transmitted IP address and the port. Optionally, the new PBFT consensus network comprises a first node MN1The second MN2And all nodes of the BN (base _ net) network. This is to configure all nodes of the BN (base _ net) network as a base, i.e. all new consensus networks must contain all nodes of these BN networks.
Meanwhile, MN (member _ net) of MN (member _ net) network1And receiving the result that the authority authentication is passed.
S3-6, first node MN1And locally monitoring whether the PBFT consensus network is successfully built. The criterion for success is that the second node MN can be received2And a P2P message sent by the BN (base _ net) network.
More specifically, the detailed flow of the processing of steps S3-4 and S3-5, i.e., BN nodes, is described with reference to fig. 5.
Step S3-4 includes:
s3-4-1, node BNXNode initialization, i.e. initialization of the underlying intelligent contract, is performed. The intelligent contract realizes the following functions: 1) setting a permission member list: and setting which users have the authority to dynamically establish a PBFT consensus network. 2) Delete rights member list: and deleting the authorized user. 3) And (3) changing the local configuration file: the IP and address of each node on the new consensus network is specified. 4) Create a "consensus thread": and calling a main program to create a 'consensus thread' for the new consensus network so as to participate in the new consensus process.
S3-4-2, node BNXReceiving a first node MN1A request for network establishment is sent, wherein the request comprises the network ID and the IP and port of other nodes in the network. The network ID is the ID of the dynamic PBFT consensus network to be newly created. The ID is a unique random number that MN1 node generates on its own initiative, generated by the requestor.
S3-4-3, node BNXDetermining whether the network already exists, and if so,success is returned directly.
S3-4-4, node BNXJudging a first node MN1And if the rule of the intelligent contract is met, namely, the intelligent contract is in the white list, and if the rule is not in the white list, failure is directly returned.
S3-4-5, node BNXAnd changing local configuration to indicate IP and port required by the network ID.
S3-4-6, node BNXSetting a first node MN1Is the master node of the new consensus network.
S3-4-7, starting P2P communication and returning success.
The above-described embodiments are merely preferred embodiments of the present invention, and general changes and substitutions by those skilled in the art within the technical scope of the present invention are included in the protection scope of the present invention.
Claims (10)
1. A block chain allocation method for dynamic networking is characterized by comprising the following steps:
s1, constructing a PBFT consensus network, wherein the PBFT consensus network is composed of MN nodes;
s2, constructing a basic network, wherein the basic network is composed of BN (boron nitride) nodes, participates in the consensus of all PBFT (basic packet transport function) consensus networks, and stores the accounts of all the consensus networks;
s3, a certain node MN in PBFT consensus networkXApplying for constructing a new PBFT consensus network to the basic network, confirming whether the node has authority through an intelligent contract by the basic network, and if the node is determined to be the certain node MN by the basic networkXIf qualified, each MN node in the original PBFT consensus network is MN-specificXThe parameters specified in (1) construct a new PBFT consensus network.
2. The method for configuring blockchain in dynamic networking according to claim 1, wherein the step S1 includes:
s1-1: nodes in the PBFT consensus network are configured to decide which MN nodes to accept to form the consensus network.
3. The block chain allocation method for dynamic networking according to claim 2,
the MN node is configured to: the consensus of the MN nodes can only be one at a time.
4. The method for configuring blockchain in dynamic networking according to claim 1, wherein the step S2 includes:
s2-1, establishing an intelligent contract on a basic network, and based on the intelligent contract, realizing: setting an authority member list, and determining members having authority to dynamically establish a PBFT consensus network; deleting the authority member list; changing a local configuration file, and specifying the IP and the address of each node on the new consensus network; and participating the new consensus network in the new consensus process.
5. The method for configuring blockchain in dynamic networking according to claim 4, wherein the step S2 comprises:
and S2-2, each BN node independently participates in the consensus of different consensus networks.
6. The method for configuring blockchain in dynamic networking according to claim 1, wherein the step S3 includes:
1) a certain node MN in the PBFT consensus networkXSending a request to any node BNx of the basic network, sending a request for creating a new consensus network, wherein the request comprises the node MNXIP address and port of;
2) the basic network starts the basic consensus of itself, and decides whether to allow the certain node MN or not through the preset rule in the intelligent contractXCreating a new PBFT consensus network;
3) each node of the basic network connects the certain node MNXSet as the master node of the new PBFT consensus network and MN according to said certain nodeXAnd configuring new PBFT common network parameters by the transmitted IP address and port.
7. The block chain allocation method for dynamic networking according to claim 6,
step 1) in S3, the request further including a network ID, the network ID being an ID of a dynamic PBFT consensus network to be newly created, the network ID being a unique random number actively generated by the MN1 node;
in step 3) of S3, the arbitrary node BNx changes the local configuration, indicating the IP and port required by the network ID.
8. The method for configuring blockchain in dynamic networking according to claim 6, wherein the step S3 further comprises:
4) the certain node MNXWhether the new PBFT consensus network has been built successfully is determined by monitoring P2P messages sent from the base network.
9. The method for configuring blockchain in dynamic networking according to claim 6, wherein the step 2) in the step S3 further comprises:
node BNXInitializing nodes, establishing an intelligent contract, and realizing the following steps based on the intelligent contract: setting an authority member list, and determining members having authority to dynamically establish a PBFT consensus network; deleting the authority member list; changing a local configuration file, and specifying the IP and the address of each node on the new consensus network; and participating the new consensus network in the new consensus process.
10. The block chain allocation method for dynamic networking according to claim 5,
in S2-2, in the BN node, multithreading is implemented in the main program, and the node participates in the consensus of different consensus networks independently in a multithreading manner, one thread for each consensus network, so that the consensus threads do not affect each other.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010207170.2A CN111447087B (en) | 2020-03-23 | 2020-03-23 | Block chain configuration method for dynamic networking |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010207170.2A CN111447087B (en) | 2020-03-23 | 2020-03-23 | Block chain configuration method for dynamic networking |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111447087A true CN111447087A (en) | 2020-07-24 |
| CN111447087B CN111447087B (en) | 2023-04-07 |
Family
ID=71655658
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010207170.2A Active CN111447087B (en) | 2020-03-23 | 2020-03-23 | Block chain configuration method for dynamic networking |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111447087B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115834581A (en) * | 2022-11-17 | 2023-03-21 | 中国联合网络通信集团有限公司 | Block chain based networking method and device, block chain node and storage medium |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107171829A (en) * | 2017-04-24 | 2017-09-15 | 杭州趣链科技有限公司 | A kind of dynamic node management method for algorithm realization of being known together based on BFT |
| CN107579848A (en) * | 2017-08-30 | 2018-01-12 | 上海保险交易所股份有限公司 | The method that common recognition node is dynamically changed in practical Byzantine failure tolerance common recognition mechanism |
| CN107807984A (en) * | 2017-10-31 | 2018-03-16 | 上海分布信息科技有限公司 | A kind of block chain network of subregion and its method for realizing subregion common recognition |
| WO2018073482A1 (en) * | 2016-10-18 | 2018-04-26 | Nokia Technologies Oy | Accession control for network nodes |
| CN108616596A (en) * | 2018-05-09 | 2018-10-02 | 南京邮电大学 | It is adaptively known together method based on the block chain that dynamic authorization and network environment perceive |
| CN109462587A (en) * | 2018-11-09 | 2019-03-12 | 四川虹微技术有限公司 | Block chain is layered common recognition method, block chain network system and block chain node |
| WO2019072294A2 (en) * | 2018-12-13 | 2019-04-18 | Alibaba Group Holding Limited | Achieving consensus among network nodes in a distributed system |
| CN110727731A (en) * | 2019-09-05 | 2020-01-24 | 阿里巴巴集团控股有限公司 | Method for adding node in block chain network and block chain system |
-
2020
- 2020-03-23 CN CN202010207170.2A patent/CN111447087B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018073482A1 (en) * | 2016-10-18 | 2018-04-26 | Nokia Technologies Oy | Accession control for network nodes |
| CN107171829A (en) * | 2017-04-24 | 2017-09-15 | 杭州趣链科技有限公司 | A kind of dynamic node management method for algorithm realization of being known together based on BFT |
| CN107579848A (en) * | 2017-08-30 | 2018-01-12 | 上海保险交易所股份有限公司 | The method that common recognition node is dynamically changed in practical Byzantine failure tolerance common recognition mechanism |
| CN107807984A (en) * | 2017-10-31 | 2018-03-16 | 上海分布信息科技有限公司 | A kind of block chain network of subregion and its method for realizing subregion common recognition |
| CN108616596A (en) * | 2018-05-09 | 2018-10-02 | 南京邮电大学 | It is adaptively known together method based on the block chain that dynamic authorization and network environment perceive |
| CN109462587A (en) * | 2018-11-09 | 2019-03-12 | 四川虹微技术有限公司 | Block chain is layered common recognition method, block chain network system and block chain node |
| WO2019072294A2 (en) * | 2018-12-13 | 2019-04-18 | Alibaba Group Holding Limited | Achieving consensus among network nodes in a distributed system |
| CN110727731A (en) * | 2019-09-05 | 2020-01-24 | 阿里巴巴集团控股有限公司 | Method for adding node in block chain network and block chain system |
Non-Patent Citations (1)
| Title |
|---|
| 宋琪杰等: "面向物联网区块链的共识机制优化研究", 《电信科学》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115834581A (en) * | 2022-11-17 | 2023-03-21 | 中国联合网络通信集团有限公司 | Block chain based networking method and device, block chain node and storage medium |
| CN115834581B (en) * | 2022-11-17 | 2024-04-16 | 中国联合网络通信集团有限公司 | Block chain-based networking method and device, block chain node and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111447087B (en) | 2023-04-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111614708B (en) | Transaction system based on block chain | |
| MXPA05010770A (en) | Method for establishing communication between peer-groups. | |
| CN112189328A (en) | System and method for propagating data packets in a network of nodes | |
| CN113067902B (en) | Block chain message transmission method and device | |
| JP2008520018A (en) | Method and system for authenticating a requestor without providing a key | |
| CN111338906B (en) | Terminal equipment, edge node and block chain-based application supervision method and system | |
| KR20200081533A (en) | Blockchain Consensus Method based Improved Dynamic Blind Voting for Internet of Things Environment | |
| CN113824674B (en) | Alliance chained data structure network management method, management node and medium | |
| CN110971506B (en) | Decentralized real-time cluster communication method, device, equipment and system | |
| CN114118447A (en) | Novel federal learning system, method and device, computer equipment and storage medium | |
| CN110324415B (en) | Method, device, equipment and medium for realizing routing of peer-to-peer network | |
| CN111447087B (en) | Block chain configuration method for dynamic networking | |
| CN114202329A (en) | Service processing method, device, node equipment and storage medium | |
| WO2020237453A1 (en) | Method and apparatus for implementing secure multi-party computation, computer device, and storage medium | |
| CN111798234A (en) | Lightweight block chain system and construction method | |
| CN112910663B (en) | Method, device, equipment and storage medium for message broadcasting and terminal registration | |
| CN111709053B (en) | Operation method and operation device based on loose coupling transaction network | |
| CN113542033A (en) | Many-to-many mapping method and system for alliance chain infrastructure and management platform | |
| CN112702337A (en) | Authorization processing method and device for block node data and computer equipment | |
| CN113612732B (en) | Resource calling method and device and multiparty secure computing system | |
| US6771759B2 (en) | Method and apparatus for managing parties to a multipoint conference using digital techniques | |
| CN115865705A (en) | Multi-party federal learning system, method, equipment and medium based on supervision mechanism | |
| CN113595749B (en) | Communication method and device for realizing multi-party network node intercommunication based on IRC platform | |
| CN115086353A (en) | Block chain event processing method and related device, equipment, platform and storage medium | |
| CN111541732B (en) | Method for avoiding invalid occupation of connection resources by client in P2P network, computer readable storage medium and P2P network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |