CN114866357B - Power data sharing method and system based on cross-link technology - Google Patents
Power data sharing method and system based on cross-link technology Download PDFInfo
- Publication number
- CN114866357B CN114866357B CN202210791200.8A CN202210791200A CN114866357B CN 114866357 B CN114866357 B CN 114866357B CN 202210791200 A CN202210791200 A CN 202210791200A CN 114866357 B CN114866357 B CN 114866357B
- Authority
- CN
- China
- Prior art keywords
- data
- parallel chain
- node
- chain
- uplink
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- 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/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
- H04L63/045—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload wherein the sending and receiving network entities apply hybrid encryption, i.e. combination of symmetric and asymmetric encryption
-
- 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
-
- 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/20—Network architectures or network communication protocols for network security for managing network security; network security policies in general
-
- 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/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
-
- 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
-
- 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/3297—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 involving time stamps, e.g. generation of time stamps
-
- 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
- Y04—INFORMATION OR COMMUNICATION TECHNOLOGIES HAVING AN IMPACT ON OTHER TECHNOLOGY AREAS
- Y04S—SYSTEMS INTEGRATING TECHNOLOGIES RELATED TO POWER NETWORK OPERATION, COMMUNICATION OR INFORMATION TECHNOLOGIES FOR IMPROVING THE ELECTRICAL POWER GENERATION, TRANSMISSION, DISTRIBUTION, MANAGEMENT OR USAGE, i.e. SMART GRIDS
- Y04S40/00—Systems for electrical power generation, transmission, distribution or end-user application management characterised by the use of communication or information technologies, or communication or information technology specific aspects supporting them
- Y04S40/20—Information technology specific aspects, e.g. CAD, simulation, modelling, system security
Abstract
The invention relates to the technical field of power data safety sharing, and particularly provides a power data sharing method and system based on a cross-link technology.
Description
Technical Field
The invention relates to the technical field of power data safety sharing, in particular to a power data sharing method and system based on a cross-link technology.
Background
With the construction of power grid informatization and service expansion, the generated power service has the characteristics of multiple types, large scale, high value, coefficient and the like. How to efficiently and regularly manage the power data to realize safe sharing, safe transaction, safe preservation and tracing of the power data is one of the essential parts for promoting the development of the power industry. Current power data faces a number of problems, mainly the following:
(1) at present, the power data are stored in databases of power grid companies, power production enterprises and some energy data suppliers in a centralized way, and the data storage is realized by independently storing the databases in entities, so that information islanding is caused.
(2) Most of the power data contains a large amount of sensitive data, which relate to equipment information, operation secrets, user privacy and the like, and the data are not suitable for being opened to the outside.
Power block chain applications are very slow. The blockchain technology is a combined technology of collective cryptography, consensus mechanism, intelligent contracts, distributed storage and the like, and is essentially a distributed database capable of sharing data. The data stored by the block chain technology has the characteristics of being not falsifiable, traceable, collectively maintained and the like.
The application of the block chain is that a single block chain network is built under the consideration of a single scene, and due to the high isomerization between chains, data stored in the block chain network is intelligently shared among the single block chain networks. The cross-chain technology can realize data interconnection and intercommunication among chains, and improve interoperability of a multi-block chain network and expandability of data in the chains.
The consensus mechanism is one of the key technologies of the block chain, and the mainstream consensus mechanisms include Proof of workload (PoW), Proof of rights and interests (PoS), Practical Byzantine Fault-tolerant consensus algorithm (PBFT), and Raft.
The cross-chain technology is a key for realizing a value network, is a good medicine for saving a coalition chain from a dispersed independent island, is a bridge for expanding and connecting a block chain outwards, can realize information sharing among multiple chains, mainly comprises a Notary mechanism (Notary schemes), a side chain/relay (Sidechains/relays), Hash locking (Hash-locking) and Distributed private key control (Distributed private key control), and is represented by Polkadot and Cosmos in the conventional cross-chain project.
polkadot is a mainstream cross-link implementation project at present, and cross-link transaction among multi-block links can be implemented by utilizing polkadot.
In the prior art, polkadot is composed of four core components: relay chains (real chain), parallel chains (Parachain), transit bridges (Bridge), and block chain development frameworks (Substrate).
The relay chain is responsible for chaining and validating the parallel chain: the relay link is connected to the polkadot network. The relay chain secures the parallel chains and enables communication between the parallel chains, the content of which may be transactions or any form of data. On which developers can access various types of services.
Parallel chains are custom chains based on various applications: the parallel chains are block chains parallel to the wave card network, and each parallel chain can independently design own architecture according to different service requirements. Parallel links may also be used for concurrent transactions to improve scalability, which is secured by connecting relay links. The parallel chain is the service accessing each relay chain, and the parallel chain needs to be operated without paving and bridging by itself and directly connected with the relay chain. The latter is responsible for block validation and ecological management of parallel chains.
However, the current polkadot technology can be added to data in any form and can also be accessed to various services, and the polkadot technology is not applied to power data storage and sharing in the power industry. Furthermore, the consensus mechanism applied to the polkadot network at present is only PoS, and cannot be adjusted according to related regional services on each parallel chain, and the PoS cannot realize node fault tolerance and fault elimination of related power data because the PoS does not belong to a Byzantine algorithm or an algorithm capable of accommodating a fault node.
Disclosure of Invention
In order to overcome the defects, the invention provides a power data sharing method and system based on a cross-chain technology.
In a first aspect, a power data sharing method based on a cross-chain technology is provided, and the power data sharing method based on the cross-chain technology includes:
step 1, acquiring data to be uplink of each node in a parallel chain;
step 2, encrypting, chaining and block outputting are carried out on the data to be chained in sequence;
step 3, carrying out privacy analysis on the uplink data, if the uplink data meet the preset data sharing requirement, sending data sharing request information corresponding to the uplink data to other nodes except the main node in the parallel chain, carrying out consensus on the uplink data, and executing step 4, otherwise, ending the operation;
and 4, if other nodes except the main node in the parallel chain exceed 2/3 agreement, performing log copy and archiving on the uplink data, and uploading the uplink data, the destination and the timestamp corresponding to the uplink data and the reputation value of the parallel chain to a relay chain, otherwise, ending the operation.
Preferably, the encryption in step 2 is a symmetric encryption algorithm, an asymmetric encryption algorithm, a hash algorithm, or a cryptographic algorithm.
Preferably, in the step 2, before encrypting the data to be uplink, the method includes: and the master node in the parallel chain carries out data cleaning on the data to be uplink.
Preferably, in the step 3, a raft consensus algorithm is adopted to perform consensus on the uplink data.
Preferably, in step 4, the reputation value of the parallel chain is calculated by the following formula:
in the above formula, B k,t Is the reputation value, delta, of the node k of the parallel chain at the time of the t-th data sharing k Number of good comments, theta, obtained after data sharing is completed for node k of parallel chain k Actual number of data shares, t, for node k of the parallel chain k And the number of times of starting participating in data sharing for the node k of the parallel chain is N, and the total number of the nodes of the parallel chain is N.
In a second aspect, a power data sharing parallel chain based on a chain crossing technology is provided, which includes:
the acquisition module is used for acquiring data to be uplink of each node in the parallel chain;
the processing module is used for sequentially encrypting the data to be uplink, uplink and block output;
the first judgment module is used for carrying out privacy analysis on the uplink data, if the uplink data meet the preset data sharing requirement, sending data sharing request information corresponding to the uplink data to other nodes except the main node in a parallel chain, carrying out consensus on the uplink data, and executing the second judgment module, otherwise, ending the operation;
and the second judgment module is used for copying and archiving the uplink data if other nodes except the main node in the parallel chain exceed 2/3 agreement, and uploading the uplink data, the destination and the timestamp corresponding to the uplink data and the reputation value of the parallel chain to a relay chain, otherwise, ending the operation.
Preferably, the encryption in the processing module adopts a symmetric encryption algorithm, an asymmetric encryption algorithm, a hash algorithm or a national encryption algorithm.
Preferably, the processing module, before encrypting the data to be uplink, includes: and the master node in the parallel chain carries out data cleaning on the data to be uplink.
Preferably, in the first determining module, a raft consensus algorithm is used to perform consensus on the uplink data.
Preferably, in the second determining module, the reputation value of the parallel chain is calculated as follows:
in the above formula, B k,t Is the reputation value, delta, of the node k of the parallel chain at the time of the t-th data sharing k Number of good comments, theta, obtained after data sharing is completed for node k of parallel chain k Actual number of data shares, t, for node k of the parallel chain k And the number of times of starting participating in data sharing for the node k of the parallel chain is N, and the total number of the nodes of the parallel chain is N.
In a third aspect, a power data sharing method based on a cross-chain technology is provided, where the power data sharing method based on the cross-chain technology includes:
step 5, judging whether the credit value of the parallel chain is larger than a preset credit value threshold, if so, performing consensus on the data of the uplink chain, and executing step 6, otherwise, ending the operation;
and 6, if the primary node of the parallel chain exceeds 2/3 agreement, linking the uplink data and outputting the blocks to generate a shared data book, and storing the shared data book in the primary node of each parallel chain, otherwise, ending the operation.
Preferably, in the step 5, the PBFT algorithm is adopted to perform consensus on the uplink data.
Preferably, after the step 6, the method further comprises:
if the data sharing of the t th time of the node k of the parallel chain is successful, updating the reputation value of the node k of the parallel chain when the data sharing of the t +1 th time is performed according to the following formula:
if the t-th data sharing of the node k of the parallel chain fails, updating the reputation value of the node k of the parallel chain when the t + 1-th data sharing is performed according to the following formula:
in the above formula, B k,t+1 Is the reputation value of the node k of the parallel chain at the t +1 th data sharing, B k,t And H is a preset reward and punishment coefficient, and is the reputation value of the node k of the parallel chain during the t-th data sharing.
Preferably, in step 5, the reputation value of the parallel chain is calculated as follows:
in the above formula, B k,t Is the reputation value, delta, of the node k of the parallel chain at the time of the t-th data sharing k Number of good comments, theta, obtained after data sharing is completed for node k of parallel chain k Actual number of data shares, t, for node k of the parallel chain k And the number of times of starting participating in data sharing for the node k of the parallel chain is N, and the total number of the nodes of the parallel chain is N.
In a fourth aspect, a power data sharing relay chain based on a chain crossing technology is provided, which includes:
the third judging module is used for judging whether the credit value of the parallel chain is larger than a preset credit value threshold, if so, the cochain data is identified, and the fourth judging module is executed, otherwise, the operation is ended;
and a fourth determining module, configured to link the uplink data and send out a block if the master node of the parallel chain exceeds 2/3 agreement, generate a shared data book, and store the shared data book in the master node of each parallel chain, otherwise, end the operation.
Preferably, in the third determining module, the PBFT algorithm is used to perform consensus on the uplink data.
Preferably, the system further includes an update module, specifically configured to:
if the data sharing of the t th time of the node k of the parallel chain is successful, updating the reputation value of the node k of the parallel chain when the data sharing of the t +1 th time is performed according to the following formula:
if the t-th data sharing of the node k of the parallel chain fails, updating the reputation value of the node k of the parallel chain in the t + 1-th data sharing according to the following formula:
in the above formula, B k,t+1 Is the reputation value of the node k of the parallel chain at the t +1 th data sharing, B k,t And H is a preset reward and punishment coefficient, and is the reputation value of the node k of the parallel chain during the t-th data sharing.
Preferably, in the third determining module, the reputation value of the parallel chain is calculated as follows:
in the above formula, B k,t Is the reputation value, delta, of the node k of the parallel chain at the time of the t-th data sharing k Number of good comments, theta, obtained after data sharing is completed for node k of parallel chain k Actual number of data shares, t, for node k of the parallel chain k And the number of times of starting participating in data sharing for the node k of the parallel chain is N, and the total number of the nodes of the parallel chain is N.
In a fifth aspect, a power data sharing method based on a cross-chain technology is provided, and the power data sharing method based on the cross-chain technology includes:
step 1, a main node in a parallel chain acquires data to be uplinked of each node in the parallel chain;
step 2, the main node in the parallel chain sequentially encrypts the data to be uplink, uplinks and outputs blocks;
step 3, the main node in the parallel chain carries out privacy analysis on the uplink data, if the uplink data meet the preset data sharing requirement, the data sharing request information corresponding to the uplink data is sent to other nodes except the main node in the parallel chain, the uplink data are identified together, and the step 4 is executed, otherwise, the operation is ended;
step 4, if other nodes except the main node in the parallel chain exceed 2/3 agreement, the main node in the parallel chain performs log copy and archiving on the uplink data, and sends the uplink data, the destination and the timestamp corresponding to the uplink data and the reputation value of the parallel chain up to the relay chain, otherwise, the operation is ended;
step 5, the relay link judges whether the credit value of the parallel link is larger than a preset credit value threshold, if so, the uplink data is identified in common, and step 6 is executed, otherwise, the operation is ended;
and 6, if the master node of the parallel chain exceeds 2/3 agreement, the relay chain uplinks and blocks the uplinked data to generate a shared data ledger, and stores the shared data ledger in the master node of each parallel chain, otherwise, the operation is ended.
In a sixth aspect, a power data sharing system based on a cross-chain technology is provided, which includes: the parallel chain and the relay chain.
In a seventh aspect, a computer device is provided, comprising: one or more processors;
the processor to store one or more programs;
the one or more programs, when executed by the one or more processors, implement the power data sharing method based on the cross-chain technique.
In an eighth aspect, a computer-readable storage medium is provided, on which a computer program is stored, which, when executed, implements the power data sharing method based on the cross-chain technology.
One or more technical schemes of the invention at least have one or more of the following beneficial effects:
the invention provides a power data sharing method and system based on a cross-chain technology, which comprises the following steps: step 1, a main node in a parallel chain acquires data to be uplinked of each node in the parallel chain; step 2, the main node in the parallel chain sequentially encrypts the data to be uplink, uplinks and outputs blocks; step 3, the main node in the parallel chain carries out privacy analysis on the uplink data, if the uplink data meet the preset data sharing requirement, the data sharing request information corresponding to the uplink data is sent to other nodes except the main node in the parallel chain, common identification is carried out on the uplink data, and step 4 is executed, otherwise, the operation is ended; and 4, if other nodes except the main node in the parallel chain exceed 2/3 agreement, the main node in the parallel chain performs log copy and archiving on the uplink data, and uploads the uplink data, a destination and a timestamp corresponding to the uplink data and the reputation value of the parallel chain to a relay chain, otherwise, the operation is ended. Step 5, the relay chain judges whether the credit value of the parallel chain is larger than a preset credit value threshold, if so, the data of the uplink chain are identified in common, and step 6 is executed, otherwise, the operation is ended; and 6, if the master node of the parallel chain exceeds 2/3, the relay chain links the uplink data and outputs the uplink data to generate a shared data account book, and stores the shared data account book in the master node of each parallel chain, otherwise, the operation is ended. The technical scheme provided by the invention adopts a block chain cross-chain technology, so that the data sharing of power data in a cross-region and cross-region manner can be realized; the parallel chain and the relay chain adopt different consensus algorithms, can adapt to service requirements in different ranges, can be improved and applied according to related service requirements, and guarantees the power data sharing efficiency and safety. Furthermore, the invention can ensure that the power data sharing range among all the areas is open and controllable after the realization, realizes the data interaction among a large range, and has great application prospect.
Drawings
Fig. 1 is a schematic flow chart illustrating main steps of a parallel chain side power data sharing method based on a cross-chain technology according to an embodiment of the present invention;
fig. 2 is a main structural block diagram of a parallel chain side power data sharing apparatus based on a chain crossing technology according to an embodiment of the present invention;
fig. 3 is a schematic flowchart of main steps of a relay link-side power data sharing method based on a cross-link technology according to an embodiment of the present invention;
fig. 4 is a main structural block diagram of a relay link-side power data sharing device based on a cross-link technology according to an embodiment of the present invention.
Detailed Description
The following describes embodiments of the present invention in further detail with reference to the accompanying drawings.
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
As introduced by the background, power blockchain applications are very slow. The blockchain technology is a combined technology of collective cryptography, consensus mechanism, intelligent contracts, distributed storage and the like, and is essentially a distributed database capable of sharing data. The data stored by the block chain technology has the characteristics of being not falsifiable, traceable, collectively maintained and the like.
The application of the block chain is that a single block chain network is built under a single scene, and data stored in the block chain network is intelligently shared among the single block chain networks due to high isomerization among chains. The cross-chain technology can realize data interconnection and intercommunication between chains, and improve interoperability of the multi-block chain network and expandability of data in the chains.
The consensus mechanism is one of the key techniques of the block chain, and the mainstream consensus mechanisms include PoW, PoS, PBFT, Raft, etc.
The cross-chain technology is a key for realizing a value network, is a good medicine for saving a coalition chain from a dispersed independent island, is a bridge for expanding and connecting a block chain outwards, can realize information sharing among multiple chains, mainly comprises a Notary mechanism (Notary schemes), a side chain/relay (Sidechains/relays), Hash locking (Hash-locking) and Distributed private key control (Distributed private key control), and is represented by Polkadot and Cosmos in the conventional cross-chain technology.
polkadot is a mainstream cross-link implementation project at present, and cross-link transaction among multi-block links can be implemented by utilizing polkadot.
In the prior art, polkadot is composed of four core components: relay chains (real chain), parallel chains (Parachain), Bridge (Bridge), and Substrate.
The relay chain is responsible for chaining and validating the parallel chain: the relay link is connected to polkadot network. The relay chain secures the parallel chains and enables communication between the parallel chains, the content of which may be transactions or any form of data. On which developers can access various types of services.
Parallel chains are custom chains based on various applications: the parallel chains are block chains parallel to the wave card network, and each parallel chain can independently design own architecture according to different service requirements. Parallel chains may also be used for concurrent transactions to improve scalability, which ensures its security by connecting relay chains. The parallel chain is the service accessing each relay chain, and the parallel chain needs to be operated without paving and bridging by itself and directly connected with the relay chain. The latter is responsible for block validation and ecological management of parallel chains.
However, the current polkadot technology can be added to data in any form and can also be accessed to various services, and the polkadot technology is not applied to power data storage and sharing in the power industry. Furthermore, the consensus mechanism applied to the polkadot network at present is only PoS, and cannot be adjusted according to related regional services on each parallel chain, and the PoS cannot realize node fault tolerance and fault elimination of related power data because the PoS does not belong to a Byzantine algorithm or an algorithm capable of accommodating a fault node.
In order to solve the above problems, the present invention provides a power data sharing method and system based on a cross-link technology, including: step 1, a main node in a parallel chain acquires data to be uplinked of each node in the parallel chain; step 2, the main node in the parallel chain sequentially encrypts the data to be uplink, uplinks and outputs blocks; step 3, the main node in the parallel chain carries out privacy analysis on the uplink data, if the uplink data meet the preset data sharing requirement, the data sharing request information corresponding to the uplink data is sent to other nodes except the main node in the parallel chain, the uplink data are identified together, and the step 4 is executed, otherwise, the operation is ended; and 4, if other nodes except the main node in the parallel chain exceed 2/3 agreement, the main node in the parallel chain performs log copy and archiving on the uplink data, and uploads the uplink data, a destination and a timestamp corresponding to the uplink data and the reputation value of the parallel chain to a relay chain, otherwise, the operation is ended. Step 5, the relay link judges whether the credit value of the parallel link is larger than a preset credit value threshold, if so, the uplink data is identified in common, and step 6 is executed, otherwise, the operation is ended; and 6, if the master node of the parallel chain exceeds 2/3, the relay chain links the uplink data and outputs the uplink data to generate a shared data account book, and stores the shared data account book in the master node of each parallel chain, otherwise, the operation is ended. The technical scheme provided by the invention adopts a block chain cross-chain technology, so that the data sharing of power data in a cross-region and cross-region manner can be realized; the parallel chain and the relay chain adopt different consensus algorithms, can adapt to service requirements in different ranges, can be improved and applied according to related service requirements, and guarantees the power data sharing efficiency and safety. Furthermore, after the realization of the invention, the public controllability of the electric power data sharing range among all regions can be ensured, the data interaction among a large range is realized, and the invention has a great application prospect.
Example 1
Referring to fig. 1, fig. 1 is a schematic flow chart illustrating main steps of a parallel chain side power data sharing method based on a chain crossing technique according to an embodiment of the present invention. As shown in fig. 1, the parallel chain side power data sharing method based on the cross-chain technology in the embodiment of the present invention mainly includes the following steps:
step 1, acquiring data to be uplink-linked of each node in a parallel chain;
step 2, encrypting, chaining and block outputting are carried out on the data to be chained in sequence;
step 3, carrying out privacy analysis on the uplink data, if the uplink data meet the preset data sharing requirement, sending data sharing request information corresponding to the uplink data to other nodes except the main node in the parallel chain, carrying out consensus on the uplink data, and executing step 4, otherwise, ending the operation;
and 4, if other nodes except the main node in the parallel chain exceed 2/3 agreement, performing log copy and archiving on the uplink data, and uploading the uplink data, the destination and the timestamp corresponding to the uplink data and the reputation value of the parallel chain to a relay chain, otherwise, ending the operation.
In this embodiment, in the step 2, the typical data encryption method for the block chain mainly includes four types: symmetric encryption, asymmetric encryption, hash algorithms, and cryptographic algorithms. For some data which is high in privacy and needs to be stored permanently and only needs to be archived, the hash algorithm is used in the invention, and for some data which is medium in privacy and only limits to be opened under the environment of two parties and below, the asymmetric encryption algorithm is used for encrypting the data.
Further, in the step 2, before encrypting the data to be uplink, the method includes: and the main node in the parallel chain carries out data cleaning on the data to be uplinked.
In this embodiment, in step 3, a raft consensus algorithm is used to perform consensus on the uplink data.
In one embodiment, in step 4, the reputation value of the parallel chain is calculated as follows:
in the above formula, B k,t Is the reputation value, delta, of the node k of the parallel chain at the time of the t-th data sharing k Number of good comments, theta, obtained after data sharing is completed for node k of parallel chain k Actual number of data shares, t, for node k of the parallel chain k And the number of times of starting participating in data sharing for the node k of the parallel chain is N, and the total number of the nodes of the parallel chain is N.
Example 2
Based on the same inventive concept, the present invention provides a power data sharing parallel chain based on a cross-chain technology, as shown in fig. 2, the power data sharing parallel chain based on the cross-chain technology includes:
the acquisition module is used for acquiring data to be uplink of each node in the parallel chain;
the processing module is used for sequentially encrypting the data to be uplink, uplink and block output;
the first judgment module is used for carrying out privacy analysis on the uplink data, if the uplink data meet the preset data sharing requirement, sending data sharing request information corresponding to the uplink data to other nodes except the main node in a parallel chain, carrying out consensus on the uplink data, and executing the second judgment module, otherwise, ending the operation;
and the second judgment module is used for copying and archiving the uplink data if other nodes except the main node in the parallel chain exceed 2/3 agreement, and uploading the uplink data, the destination and the timestamp corresponding to the uplink data and the reputation value of the parallel chain to a relay chain, otherwise, ending the operation.
In this embodiment, the encryption in the processing module adopts a symmetric encryption algorithm, an asymmetric encryption algorithm, a hash algorithm, or a cryptographic algorithm.
In this embodiment, before encrypting the data to be uplink, the processing module includes: and the master node in the parallel chain carries out data cleaning on the data to be uplink.
In this embodiment, in the first determining module, a raft consensus algorithm is used to perform consensus on the uplink data.
In this embodiment, in the second determining module, the reputation value of the parallel chain is calculated as follows:
in the above formula, B k,t Is the reputation value, delta, of the node k of the parallel chain at the time of the t-th data sharing k Number of good comments, theta, obtained after data sharing is completed for node k of parallel chain k Actual number of data shares, t, for node k of the parallel chain k And the number of times of starting participating in data sharing for the node k of the parallel chain is N, and the total number of the nodes of the parallel chain is N.
Example 3
Referring to fig. 3, fig. 3 is a schematic flowchart illustrating main steps of a relay link-side power data sharing method based on a cross-link technology according to an embodiment of the present invention. As shown in fig. 3, the method for sharing power data on a relay link side based on a cross-link technology in the embodiment of the present invention mainly includes the following steps:
step 5, judging whether the credit value of the parallel chain is larger than a preset credit value threshold, if so, carrying out consensus on the data of the uplink chain, and executing step 6, otherwise, ending the operation;
and 6, if the primary node of the parallel chain exceeds 2/3 agreement, linking the uplink data and outputting the blocks to generate a shared data book, and storing the shared data book in the primary node of each parallel chain, otherwise, ending the operation.
In this embodiment, in the step 5, a PBFT algorithm is used to perform consensus on uplink data.
In this embodiment, if a power grid enterprise wants to retrieve information in an energy data business chain, the data may be called only by initiating a call request consensus to a relay chain, and after the call is completed, the monitoring structure updates the reputation value according to the interactive performance, so that after step 6, the method further includes:
if the data sharing of the t th time of the node k of the parallel chain is successful, updating the reputation value of the node k of the parallel chain when the node k of the parallel chain shares the t +1 th time according to the following formula:
if the t-th data sharing of the node k of the parallel chain fails, updating the reputation value of the node k of the parallel chain when the t + 1-th data sharing is performed according to the following formula:
in the above formula, B k,t+1 Is the reputation value of the node k of the parallel chain at the t +1 th data sharing, B k,t H is a preset reward and punishment coefficient, wherein the reputation value of the node k of the parallel chain during the t-th data sharing is shown.
In this embodiment, in step 5, the reputation value of the parallel chain is calculated as follows:
in the above formula, B k,t Is the reputation value, delta, of the node k of the parallel chain at the time of the t-th data sharing k Number of good comments, theta, obtained after data sharing is completed for node k of parallel chain k Actual number of data shares, t, for node k of the parallel chain k And the number of times of starting participating in data sharing for the node k of the parallel chain is N, and the total number of the nodes of the parallel chain is N.
Example 4
Based on the same inventive concept, the present invention further provides a power data sharing relay chain based on a cross-chain technology, as shown in fig. 4, the power data sharing relay chain based on the cross-chain technology includes:
the third judging module is used for judging whether the credit value of the parallel chain is larger than a preset credit value threshold, if so, the cochain data is identified, and the fourth judging module is executed, otherwise, the operation is ended;
and a fourth determining module, configured to link the uplink data and send out a block if the master node of the parallel chain exceeds 2/3 agreement, generate a shared data book, and store the shared data book in the master node of each parallel chain, otherwise, end the operation.
Preferably, in the third determining module, a PBFT algorithm is used to perform consensus on the uplink data.
Preferably, the system further includes an update module, specifically configured to:
if the data sharing of the t th time of the node k of the parallel chain is successful, updating the reputation value of the node k of the parallel chain when the node k of the parallel chain shares the t +1 th time according to the following formula:
if the t-th data sharing of the node k of the parallel chain fails, updating the reputation value of the node k of the parallel chain when the t + 1-th data sharing is performed according to the following formula:
in the above formula, B k,t+1 Is the reputation value of the node k of the parallel chain at the t +1 th data sharing, B k,t And H is a preset reward and punishment coefficient, and is the reputation value of the node k of the parallel chain during the t-th data sharing.
Preferably, in the third determining module, the reputation value of the parallel chain is calculated by the following formula:
in the above formula, B k,t Is the reputation value, delta, of the node k of the parallel chain at the time of the t-th data sharing k Completion number for node k of parallel chainAccording to the number of good comments, theta, obtained after sharing k Actual number of data shares, t, for node k of the parallel chain k And the number of times of starting participating in data sharing for the node k of the parallel chain is N, and the total number of the nodes of the parallel chain is N.
Example 5
The invention also provides a power data sharing method based on the cross-chain technology, which comprises the following steps:
step 1, a main node in a parallel chain acquires data to be uplinked of each node in the parallel chain;
step 2, the main node in the parallel chain sequentially encrypts the data to be uplink, uplinks and outputs blocks;
step 3, the main node in the parallel chain carries out privacy analysis on the uplink data, if the uplink data meet the preset data sharing requirement, the data sharing request information corresponding to the uplink data is sent to other nodes except the main node in the parallel chain, the uplink data are identified together, and the step 4 is executed, otherwise, the operation is ended;
step 4, if other nodes except the main node in the parallel chain exceed 2/3 agreement, the main node in the parallel chain performs log copy and archiving on the uplink data, and sends the uplink data, the destination and the timestamp corresponding to the uplink data and the reputation value of the parallel chain up to the relay chain, otherwise, the operation is ended;
step 5, the relay chain judges whether the credit value of the parallel chain is larger than a preset credit value threshold, if so, the data of the uplink chain are identified in common, and step 6 is executed, otherwise, the operation is ended;
and 6, if the master node of the parallel chain exceeds 2/3, the relay chain links the uplink data and outputs the uplink data to generate a shared data account book, and stores the shared data account book in the master node of each parallel chain, otherwise, the operation is ended.
Example 6
Based on the same inventive concept, the invention also provides a power data sharing system based on the chain crossing technology, which comprises the following components: the parallel chain and the relay chain.
Example 7
Based on the same inventive concept, the present invention also provides a computer apparatus comprising a processor and a memory, the memory being configured to store a computer program comprising program instructions, the processor being configured to execute the program instructions stored by the computer storage medium. The Processor may be a Central Processing Unit (CPU), or may be other general-purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), an off-the-shelf Programmable gate array (FPGA) or other Programmable logic device, a discrete gate or transistor logic device, a discrete hardware component, etc., which is a computing core and a control core of the terminal, and is specifically adapted to implement one or more instructions, and to load and execute one or more instructions in a computer storage medium so as to implement a corresponding method flow or a corresponding function, so as to implement the steps of the power data sharing method based on the cross-link technology in the foregoing embodiments.
Example 8
Based on the same inventive concept, the present invention further provides a storage medium, in particular, a computer-readable storage medium (Memory), which is a Memory device in a computer device and is used for storing programs and data. It is understood that the computer readable storage medium herein can include both built-in storage medium in the computer device and, of course, extended storage medium supported by the computer device. The computer-readable storage medium provides a storage space storing an operating system of the terminal. Also, one or more instructions, which may be one or more computer programs (including program code), are stored in the memory space and are adapted to be loaded and executed by the processor. It should be noted that the computer-readable storage medium may be a high-speed RAM memory, or may be a non-volatile memory (non-volatile memory), such as at least one disk memory. One or more instructions stored in a computer-readable storage medium may be loaded and executed by a processor to implement the steps of one of the above-described embodiments of the power data sharing method based on the cross-chain technology.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solutions of the present invention and not for limiting the same, and although the present invention is described in detail with reference to the above embodiments, those of ordinary skill in the art should understand that: modifications and equivalents may be made to the embodiments of the invention without departing from the spirit and scope of the invention, which is to be covered by the claims.
Claims (14)
1. A power data sharing method based on a cross-chain technology is characterized by comprising the following steps:
step 1, acquiring data to be uplink of each node in a parallel chain;
step 2, encrypting, chaining and block outputting are carried out on the data to be chained in sequence;
step 3, carrying out privacy analysis on the uplink data, if the uplink data meet the preset data sharing requirement, sending data sharing request information corresponding to the uplink data to other nodes except the main node in the parallel chain, carrying out consensus on the uplink data, and executing step 4, otherwise, ending the operation;
step 4, if other nodes except the main node in the parallel chain exceed 2/3 agreement, performing log copy and archiving on the uplink data, and uploading the uplink data, a destination and a timestamp corresponding to the uplink data and a reputation value of the parallel chain to a relay chain, otherwise, ending the operation;
in step 4, the calculation formula of the reputation value of the parallel chain is as follows:
in the above formula, B k,t Is the reputation value, delta, of the node k of the parallel chain at the time of the t-th data sharing k Number of good comments, theta, obtained after data sharing is completed for node k of parallel chain k Actual number of data shares, t, for node k of the parallel chain k The number of times of starting participating in data sharing for a node k of the parallel chain is N, and the N is the total number of nodes of the parallel chain;
step 5, judging whether the credit value of the parallel chain is larger than a preset credit value threshold, if so, performing consensus on the data of the uplink chain, and executing step 6, otherwise, ending the operation;
and 6, if the primary node of the parallel chain exceeds 2/3 agreement, linking the uplink data and outputting the blocks to generate a shared data book, and storing the shared data book in the primary node of each parallel chain, otherwise, ending the operation.
2. The method according to claim 1, wherein the encryption in step 2 is a symmetric encryption algorithm, an asymmetric encryption algorithm, a hash algorithm or a cryptographic algorithm.
3. The method of claim 1, wherein the step 2 of encrypting the data to be uplink comprises: and the master node in the parallel chain carries out data cleaning on the data to be uplink.
4. The method of claim 1, wherein in the step 3, a raft consensus algorithm is used to perform consensus on the data of the uplink.
5. The method of claim 1, wherein in the step 5, the PBFT algorithm is used to perform consensus on the uplink data.
6. The method of claim 1, wherein after step 6, further comprising:
if the data sharing of the t th time of the node k of the parallel chain is successful, updating the reputation value of the node k of the parallel chain when the node k of the parallel chain shares the t +1 th time according to the following formula:
B k，t+1 ＝B k，t +H
if the t-th data sharing of the node k of the parallel chain fails, updating the reputation value of the node k of the parallel chain when the t + 1-th data sharing is performed according to the following formula:
B k，t+1 ＝B k，t -H
in the above formula, B k,t+1 Is the reputation value of the node k of the parallel chain at the t +1 th data sharing, B k,t And H is a preset reward and punishment coefficient, and is the reputation value of the node k of the parallel chain during the t-th data sharing.
7. A power data sharing system based on a cross-chain technology, the system comprising: parallel chains and relay chains; the parallel chain includes:
the acquisition module is used for acquiring data to be uplink of each node in the parallel chain;
the processing module is used for sequentially encrypting the data to be uplink, uplink and block output;
the first judgment module is used for carrying out privacy analysis on the uplink data, if the uplink data meet the preset data sharing requirement, sending data sharing request information corresponding to the uplink data to other nodes except the main node in a parallel chain, carrying out consensus on the uplink data, and executing the second judgment module, otherwise, ending the operation;
a second judging module, configured to copy and archive the log of the uplink data if other nodes except the primary node in the parallel chain exceed 2/3 agreement, and upload the uplink data, a destination and a timestamp corresponding to the uplink data, and a reputation value of the parallel chain to a relay chain, otherwise, end the operation;
in the second judgment module, the calculation formula of the reputation value of the parallel chain is as follows:
in the above formula, B k,t Is the reputation value, delta, of the node k of the parallel chain at the time of the t-th data sharing k Number of good comments, theta, obtained after data sharing is completed for node k of parallel chain k Actual number of data shares, t, for node k of the parallel chain k The number of times of starting participating in data sharing for a node k of the parallel chain is N, and the N is the total number of nodes of the parallel chain;
the relay chain includes:
the third judging module is used for judging whether the credit value of the parallel chain is larger than a preset credit value threshold, if so, the cochain data is identified, and the fourth judging module is executed, otherwise, the operation is ended;
and a fourth determining module, configured to link the uplink data and send out a block if the master node of the parallel chain exceeds 2/3 agreement, generate a shared data book, and store the shared data book in the master node of each parallel chain, otherwise, end the operation.
8. The system of claim 7, wherein the encryption in the processing module employs a symmetric encryption algorithm, an asymmetric encryption algorithm, a hash algorithm, or a cryptographic algorithm.
9. The system of claim 7, wherein the processing module, prior to encrypting the data to be uplink, comprises: and the master node in the parallel chain carries out data cleaning on the data to be uplink.
10. The system of claim 7, wherein the first determining module performs consensus on the uplink data using a raft consensus algorithm.
11. The system of claim 7, wherein the third determining module performs consensus on uplink data using a PBFT algorithm.
12. The system of claim 7, wherein the system further comprises an update module specifically configured to:
if the data sharing of the t th time of the node k of the parallel chain is successful, updating the reputation value of the node k of the parallel chain when the data sharing of the t +1 th time is performed according to the following formula:
B k，t+1 ＝B k，t +H
if the t-th data sharing of the node k of the parallel chain fails, updating the reputation value of the node k of the parallel chain when the t + 1-th data sharing is performed according to the following formula:
B k，t+1 ＝B k，t -H
in the above formula, B k,t+1 Is the reputation value of the node k of the parallel chain at the t +1 th data sharing, B k,t And H is a preset reward and punishment coefficient, and is the reputation value of the node k of the parallel chain during the t-th data sharing.
13. A computer device, comprising: one or more processors;
the processor to store one or more programs;
the one or more programs, when executed by the one or more processors, implement the power data sharing method based on the cross-chain technique of any one of claims 1 to 6.
14. A computer-readable storage medium, having stored thereon a computer program which, when executed, implements a power data sharing method based on a cross-chain technique according to any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210791200.8A CN114866357B (en) | 2022-07-07 | 2022-07-07 | Power data sharing method and system based on cross-link technology |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210791200.8A CN114866357B (en) | 2022-07-07 | 2022-07-07 | Power data sharing method and system based on cross-link technology |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114866357A CN114866357A (en) | 2022-08-05 |
| CN114866357B true CN114866357B (en) | 2022-09-13 |
Family
ID=82626259
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210791200.8A Active CN114866357B (en) | 2022-07-07 | 2022-07-07 | Power data sharing method and system based on cross-link technology |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114866357B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115499454B (en) * | 2022-09-20 | 2024-03-22 | 广西师范大学 | Agricultural product data cross-link sharing method based on alliance relay links |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110784346A (en) * | 2019-10-18 | 2020-02-11 | 深圳供电局有限公司 | Reputation value-based PBFT consensus system and method |
| CN111654465A (en) * | 2020-04-17 | 2020-09-11 | 全球能源互联网研究院有限公司 | Power service cross-domain credible authentication system and method based on block chain |
| CN112488679A (en) * | 2020-12-03 | 2021-03-12 | 陈鹏 | Cross-link contract analysis method of block chain, relay chain and cross-link system |
| CN112866380A (en) * | 2021-01-15 | 2021-05-28 | 杭州链网科技有限公司 | Chain network architecture based on block chain |
| US11288669B1 (en) * | 2020-12-08 | 2022-03-29 | Project Noa, Inc. | Frictionless token based blockchain |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11917088B2 (en) * | 2020-09-21 | 2024-02-27 | International Business Machines Corporation | Integrating device identity into a permissioning framework of a blockchain |
-
2022
- 2022-07-07 CN CN202210791200.8A patent/CN114866357B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110784346A (en) * | 2019-10-18 | 2020-02-11 | 深圳供电局有限公司 | Reputation value-based PBFT consensus system and method |
| CN111654465A (en) * | 2020-04-17 | 2020-09-11 | 全球能源互联网研究院有限公司 | Power service cross-domain credible authentication system and method based on block chain |
| CN112488679A (en) * | 2020-12-03 | 2021-03-12 | 陈鹏 | Cross-link contract analysis method of block chain, relay chain and cross-link system |
| US11288669B1 (en) * | 2020-12-08 | 2022-03-29 | Project Noa, Inc. | Frictionless token based blockchain |
| CN112866380A (en) * | 2021-01-15 | 2021-05-28 | 杭州链网科技有限公司 | Chain network architecture based on block chain |
Non-Patent Citations (4)
| Title |
|---|
| Communication-Efficient and Cross-chain Empowered Federated Learning for Artificial Intelligence of Things;J. Kang等;《IEEE Transactions on Network Science and Engineering》;20220530;第1-11页 * |
| 区块链在车载自组网中的应用研究及展望;周畅等;《计算机科学》;20200228;第47卷(第2期);第213-220页 * |
| 基于CSBFT区块链的农作物全产业链信息溯源平台设计;任守纲;《农业工程学报》;20220208;第36卷(第3期);第279-286页 * |
| 支撑客户侧分布式能源交易的区块链技术研究;覃秋悦;《中国优秀硕士学位论文全文数据库信息科技辑》;20220115(第1期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114866357A (en) | 2022-08-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Knirsch et al. | Implementing a blockchain from scratch: why, how, and what we learned | |
| US11057217B2 (en) | Performing parallel execution of transactions in a distributed ledger system | |
| US20200327545A1 (en) | Performing parallel execution of transactions in a distributed ledger system | |
| US20230028606A1 (en) | Method and apparatus for vertical federated learning | |
| US11231957B2 (en) | Performing parallel execution of transactions in a distributed ledger system | |
| US11924326B2 (en) | Blockchain platform service | |
| CN112380578A (en) | Edge computing framework based on block chain and trusted execution environment | |
| CN111095218B (en) | Method, system and device for storing shared block chain data based on error correction coding | |
| CN110866837A (en) | Block chain-based vehicle insurance underwriting claim method, equipment and system | |
| CN112866380B (en) | Chain network architecture based on block chain | |
| CN111066047A (en) | Implementing a blockchain based workflow | |
| WO2020052140A1 (en) | International energy network system and information processing method | |
| CN114866357B (en) | Power data sharing method and system based on cross-link technology | |
| CN112307501B (en) | Big data system based on block chain technology, storage method and using method | |
| CN113129149A (en) | Transaction risk identification method and device based on block chain and safe multi-party calculation | |
| CN113011598A (en) | Financial data information federal migration learning method and device based on block chain | |
| Liang et al. | EduChain: A highly available education consortium blockchain platform based on Hyperledger Fabric | |
| WO2020042929A1 (en) | Block chain system | |
| Kabulov et al. | Systematic analysis of blockchain data storage and sharing technology | |
| Liu et al. | Pianist: Scalable zkrollups via fully distributed zero-knowledge proofs | |
| Vijayakumar et al. | Utilization of blockchain in medical healthcare record using hyperledger fabric | |
| CN116385028A (en) | Carbon asset data management method, device and server | |
| CN112949985B (en) | Power grid engineering supervision method and device based on block chain and computer equipment | |
| CN114549149A (en) | Smart grid energy transaction data processing method and device and computer equipment | |
| CN114390063A (en) | Message broadcasting method for block chain network, block chain node and block chain system |
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 |