CN111292187B - Blockchain billing personnel qualification competitive choice method - Google Patents
Blockchain billing personnel qualification competitive choice method Download PDFInfo
- Publication number
- CN111292187B CN111292187B CN202010064678.1A CN202010064678A CN111292187B CN 111292187 B CN111292187 B CN 111292187B CN 202010064678 A CN202010064678 A CN 202010064678A CN 111292187 B CN111292187 B CN 111292187B
- Authority
- CN
- China
- Prior art keywords
- billing
- qualification
- node
- hash value
- blockchain
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
- G06Q20/3827—Use of message hashing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
- G06Q20/3829—Payment protocols; Details thereof insuring higher security of transaction involving key management
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
-
- 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/3247—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 digital signatures
- H04L9/3249—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 digital signatures using RSA or related signature schemes, e.g. Rabin scheme
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Computer Security & Cryptography (AREA)
- Finance (AREA)
- Theoretical Computer Science (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Development Economics (AREA)
- Technology Law (AREA)
- Marketing (AREA)
- Economics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention relates to a block chain billing qualification competitive choice method, which comprises the following steps: A. the block chain node encrypts the hash value of the last block by using the private key of the node, and takes the hash value from the encryption result; B. judging whether the number of the obtained hash value preambles 0 meets the set requirement or not; C. if yes, the current blockchain node is considered to acquire accounting qualification; D. the current blockchain node sends a mid-tag broadcast to other nodes in the network. According to the invention, by adopting a random algorithm based on a large base number, as the complexity of an RSA encryption algorithm and the lottery algorithm with the hash value of the preamble 0 are both exponential levels, the increase of the computing capacity can be easily counteracted by slightly adjusting, the suspicion of monopoly can be eliminated, and a true, reasonable and reliable billing person can be obtained.
Description
Technical Field
The invention relates to the technical field of blockchains, in particular to a blockchain billing human qualification competitive choice method.
Background
The development of blockchain technology and applications has a significant impact on economy and many new opportunities. The opportunities among these are mainly categorized into two major categories.
The first category is traditional businesses that employ blockchain technology, particularly banks, dealer, insurance companies, intermediaries, title registration, and other businesses that use credit as a core value. In the past, credit costs were high due to the lack of effective technical means. We choose a reputable large bank, insurance company, intermediary company and bear a lot of fees, which is the credit cost. The occurrence of the blockchain technology greatly reduces the credit cost. Currency or stocks, contracts, certificates, etc. are digital in nature, whereas blockchains use distributed networking and mathematics to replace the original credit system with only the cost of computers and electricity. Therefore, the conventional enterprises taking credit guarantee as the service either hugs the change and reduces the operation cost of the enterprises, or the enterprises can be submerged by historical floods like Kodak and Nokia in the evolution of the technology.
The second type is blockchain enterprises with core technology, and the enterprises can provide effective services when the blockchain system brings great change to society by utilizing the core technology or a unique market method, so that the enterprises occupy favorable positions, and can grow like Microsoft with PC growth, google with Internet search growth, facebook with soaring with network social growth, and the like with blockchain development.
Blockchain technology provides a simple and reliable set of trust mechanisms, which is a significant advancement. Trust and authentication mechanisms are an important component of our human society. We choose a reputable product, bank, hotel, insurance company, trust is one of the important factors in addition to the product and service itself, and we pay premium for this. In some areas, due to high monopoly or expertise, transparency is low for the average person and our trust costs are much greater. The blockchain technology, although complex, has an algorithm that is open and can be verified by a professional, so that the blockchain technology is a great improvement.
Bitcoin and ethernet use p2p technology and if a transaction occurs, it needs to be broadcast to the whole network. It is not actually necessary to do so. The EOS and the like adopt certain mechanisms to select specific nodes to intensively process all transactions, so that the TPS is rapidly improved. But this also presents a problem. EOS selects billing nodes by so-called PoS, but is suspected of being monopolized. Only truly reliable large radix based random algorithms can get rid of this challenge.
Disclosure of Invention
The technical problem to be solved by the invention is to provide a blockchain billing qualification competitive choice method aiming at the defects in the prior art.
The technical scheme adopted for solving the technical problems is as follows:
a method of constructing a blockchain billing human qualification auction, comprising the steps of:
A. the block chain node encrypts the hash value of the last block by using the private key of the node, and takes the hash value from the encryption result;
B. judging whether the number of the obtained hash value preambles 0 meets the set requirement or not;
C. if yes, the current blockchain node is considered to acquire accounting qualification;
D. the current blockchain node sends a mid-tag broadcast to other nodes in the network.
The invention relates to a method for competing and selecting the qualification of a billing person, which further comprises the following steps:
E. receiving a middle sign broadcast of a billing person;
F. the billing person number is updated.
The method for the billing qualification auction of the invention, wherein the blockchain node executes the step A and the step B to perform the billing qualification auction during each round of billing.
The invention relates to a method for competing and selecting the qualification of billing people, wherein when the judging result in the step B is not satisfied, the current block chain link point is considered to have no qualification of billing, and the step H is executed;
H. the link point of the current block compares the quantity of qualified billing candidates received by the link point of the current block and judges whether the qualified billing candidates are full;
I. and when the judging result of the step H is that the number of qualified billing candidates is insufficient, the current block link point re-executes the step A and the step B to perform billing qualification competition.
The method for competing for billing qualifications according to the present invention, wherein the voting priority of the blockchain node obtaining billing qualifications in the step I is lower than that of the blockchain node obtaining billing qualifications in the step C.
The invention relates to a billing qualification competitive choice method, wherein when a current block chain node re-executes the step A, the hash value of the last block is added with round information, then the hash value is encrypted by using a private key of the user, and the encryption result is taken as the hash value.
The method for selecting the qualification of the billing person according to the present invention, wherein in the step F, the method for judging whether the qualified billing candidate is full, comprises:
judging the current online node number of the whole network;
adjusting the first 0 number of step B to determine how many nodes should be qualified for billing based on the total number of nodes in the entire network, which number would be 2 n And each.
The billing human qualification auction method of the present invention, wherein the blockchain includes a plurality of nodes, the plurality of nodes including: a primary node responsible for billing and/or communications, and a secondary node responsible for witnessing and verifying the billing results of the primary node.
The invention has the beneficial effects that: by adopting a random algorithm based on a large base number, the complexity of the RSA encryption algorithm and the lottery algorithm with the hash value leading value of 0 are exponential levels, and the increase of the computing capacity can be easily counteracted by slightly adjusting, so that the suspicion of monopoly can be eliminated, and a true, reasonable and reliable billing person can be obtained.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the present invention will be further described with reference to the accompanying drawings and embodiments, in which the drawings in the following description are only some embodiments of the present invention, and other drawings may be obtained by those skilled in the art without inventive effort:
FIG. 1 is a flowchart of a blockchain billing membership auction method in accordance with the preferred embodiment of the present invention;
FIG. 2 is a flowchart of a blockchain billing membership auction method in accordance with the preferred embodiment of the present invention;
FIG. 3 is a flowchart of a blockchain billing membership auction method in accordance with the preferred embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the following description will be made in detail with reference to the technical solutions in the embodiments of the present invention, and it is apparent that the described embodiments are some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by a person skilled in the art without any inventive effort, are intended to be within the scope of the present invention, based on the embodiments of the present invention.
In a preferred embodiment, the present invention relates to a blockchain billing membership auction method, as shown in fig. 1,2 and 3, comprising the steps of:
A. the block chain node encrypts the hash value of the last block by using the private key of the node (encryption by RSA), and takes the hash value from the encryption result;
B. judging whether the number of the obtained hash value preambles 0 meets the set requirement or not;
C. if yes, the current blockchain node is considered to acquire accounting qualification;
D. the current block chain node transmits a middle sign broadcast to other nodes in the network;
E. receiving a middle sign broadcast of a billing person;
F. the billing person number is updated.
By adopting a random algorithm based on a large base number, the complexity of the RSA encryption algorithm and the lottery algorithm with the hash value leading value of 0 are exponential levels, and the increase of the computing capacity can be easily counteracted by slightly adjusting, so that the suspicion of monopoly can be eliminated, and a true, reasonable and reliable billing person can be obtained.
Specifically, the method adopted in the above embodiment is as shown in fig. 2:
the hash value of the last block is signed by the private key, then the hash value (256 bits) is taken, and then the number of the preamble 0 is judged. Only a simple mathematical derivation is needed to obtain our desired results, which is based on the following: if 1 preamble 0 is required, the other bits are arbitrary with a probability of 0.5. If two preambles 0 are required, the probability is 0.25. Similarly, it is easy to obtain, requiring n preambles of 0, the probability is obtainable according to the following equation (1):
for example, if 20 leading 0 s are required, the probability is 1/1048576. Based on this rule, we can choose potential billing nodes, i.e., the leading 0 number can be adjusted to determine how many people will get billing qualifications based on the total number of nodes in the overall system.
If our system has a total of 100 tens of thousands of primary nodes, if we require 20 leading 0 s, then there are about 1 potential billing nodes, and so on:
if we only require 19 preambles of 0, then the potential billing node has about 2;
if we only require 18 preambles of 0, then there are about 4 potential billing nodes;
if we only require 17 preamble 0 s, then there are about 8 potential billing nodes;
……
in this process, signing the hash value of the previous chunk with the private key is also an important step. It is obviously impractical to sign the entire block with a private key. Only signing the hash value with the private key can result in a data that only this node can possess while being associated with the previous block. This can reliably incorporate the information of this node into the history block, greatly reducing the likelihood of being counterfeited.
After encrypting the hash value with the private key, the non-fixed-length data is obtained. The hash value is taken again for the data, so that the non-fixed-length data can be changed into fixed-length data again, the mathematical calculation of the data is simplified, and a simple and consistent drawing rule is formed.
In a further embodiment of the method, when the result of the determination in the step B is not satisfied, the current block link point is considered to be not qualified for billing, and the following step H is executed;
H. the link point of the current block compares the quantity of qualified billing candidates received by the link point of the current block and judges whether the qualified billing candidates are full;
the specific method comprises the following steps:
judging the current online node number of the whole network; adjusting the first 0 number of step B to determine how many nodes should be qualified for billing based on the total number of nodes in the entire network, which number would be 2 n A number, e.g., 1,2,4,8,16,32,64 …;
I. and (3) when the judging result of the step (H) is that the number of qualified billing candidates is insufficient, the current block link point re-executes the step (A) to perform billing qualification competitive selection.
Step H-I is a spin lottery process performed in the event that the present round of lottery results are not ideal.
Because the lottery algorithm is probabilistic, it may not be possible to generate legal candidates. At this point each candidate may join the round and re-sign the hash until it qualifies itself or a better choice is received.
In the above method for billing qualification auction, the blockchain node performs steps a-D for billing qualification auction during each round of billing. In the process of each round of billing, a round of drawing is carried out, a new billing person is selected, and the fairness of each round of billing is ensured.
Preferably, in the above method for bidding and competing for personal qualification, the voting priority of the blockchain node that obtains the billing qualification in the step I is lower than that of the blockchain node that obtains the billing qualification in the step C, and the higher the round value, the lower the priority.
More preferably, when the link point of the current block re-executes the step a, the round information is added to the hash value of the previous block, then the current block is encrypted by using its private key, and the hash value is obtained as the encryption result. The round information refers to the number of rounds of drawing, the rounds of drawing are marked by 0, 1,2 and 3 … … in sequence, and the mark is used as the basis of voting priority of the accounting nodes.
The blockchain billing qualification competitive choice method is applicable to the blockchain network with the primary node and the secondary node.
For example, when the blockchain includes multiple nodes, there may be primary nodes for accounting and/or communication, and secondary nodes for witnessing and verifying primary node accounting results, respectively, where only the primary nodes may be qualified for accounting.
It will be understood that modifications and variations will be apparent to those skilled in the art from the foregoing description, and it is intended that all such modifications and variations be included within the scope of the following claims.
Claims (6)
1. A blockchain billing human qualification auction method, comprising the steps of:
A. the block chain node encrypts the hash value of the last block by using the private key of the node in an RSA encryption algorithm mode, and takes the hash value from the encryption result;
B. judging whether the number of the obtained hash value preambles 0 meets the set requirement or not; and (C) when the judgment result is not satisfied, the current block chain link point is considered to have no billing qualification, and the step (H) is executed;
C. if yes, the current blockchain node is considered to acquire accounting qualification;
D. the current block chain node transmits a middle sign broadcast to other nodes in the network;
H. the link point of the current block compares the quantity of qualified billing candidates received by the link point of the current block and judges whether the qualified billing candidates are full;
I. when the judging result of the step H is that the number of qualified billing candidates is insufficient, the step A and the step B are re-executed by the link point of the current block to perform billing qualification competition; and C, when the link point of the current block re-executes the step A, adding round information to the hash value of the previous block, encrypting by using the private key of the current block, and taking the hash value from the encryption result.
2. The billing human qualification auction method of claim 1, further comprising the step of:
E. receiving a middle sign broadcast of a billing person;
F. the billing person number is updated.
3. The billing human qualification auction method of claim 1, wherein said blockchain node performs said step a and step B for billing qualification auction every round of billing.
4. The billing personal qualification auction method of claim 1, wherein performing said step I to qualify for billing votes has a lower priority than said step C to qualify for billing blockchain nodes.
5. The method of claim 1, wherein in the step H, the method of determining whether the qualified billing candidate is full is:
judging the current online node number of the whole network;
adjusting the first 0 number of step B to determine how many nodes should be qualified for billing based on the total number of nodes in the entire network, which number would be 2 n And each.
6. The billing human qualification auction method of claim 1, wherein said blockchain comprises a plurality of nodes, a plurality of said nodes comprising: a primary node responsible for billing and/or communications, and a secondary node responsible for witnessing and verifying the billing results of the primary node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010064678.1A CN111292187B (en) | 2020-01-20 | 2020-01-20 | Blockchain billing personnel qualification competitive choice method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010064678.1A CN111292187B (en) | 2020-01-20 | 2020-01-20 | Blockchain billing personnel qualification competitive choice method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111292187A CN111292187A (en) | 2020-06-16 |
| CN111292187B true CN111292187B (en) | 2023-08-22 |
Family
ID=71029160
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010064678.1A Active CN111292187B (en) | 2020-01-20 | 2020-01-20 | Blockchain billing personnel qualification competitive choice method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111292187B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017192837A1 (en) * | 2016-05-04 | 2017-11-09 | Silvio Micali | Distributed transaction propagation and verification system |
| CN107566124A (en) * | 2017-08-24 | 2018-01-09 | 深圳市易成自动驾驶技术有限公司 | Common recognition method for building up, block catenary system and storage medium based on lottery mechanism |
| CN110445603A (en) * | 2019-06-28 | 2019-11-12 | 成都鹰翔天际科技有限公司 | A kind of decentralization random digit generation method |
-
2020
- 2020-01-20 CN CN202010064678.1A patent/CN111292187B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017192837A1 (en) * | 2016-05-04 | 2017-11-09 | Silvio Micali | Distributed transaction propagation and verification system |
| CN107566124A (en) * | 2017-08-24 | 2018-01-09 | 深圳市易成自动驾驶技术有限公司 | Common recognition method for building up, block catenary system and storage medium based on lottery mechanism |
| CN110445603A (en) * | 2019-06-28 | 2019-11-12 | 成都鹰翔天际科技有限公司 | A kind of decentralization random digit generation method |
Non-Patent Citations (1)
| Title |
|---|
| 宋焘谊 等.区块链共识算法的比较研究.《计算机应用与软件》.2018,4-5页. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111292187A (en) | 2020-06-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Knirsch et al. | Privacy-preserving blockchain-based electric vehicle charging with dynamic tariff decisions | |
| CN107580022B (en) | Data sharing system and method | |
| Bada et al. | Towards a green blockchain: A review of consensus mechanisms and their energy consumption | |
| CN111164626A (en) | Intelligent contract execution using distributed coordination | |
| US20180068280A1 (en) | Verifying electronic transactions | |
| US11532195B2 (en) | System and method for cryptographic choice mechanisms | |
| US20220278854A1 (en) | Unity Protocol Consensus | |
| CN112801778A (en) | Federated bad asset blockchain | |
| CN113645190A (en) | Byzantine fault-tolerant consensus method considering node reputation and block chain | |
| CN110930158A (en) | Block chain DPoS common recognition method based on reward and punishment mechanism | |
| EP3906636A1 (en) | Verifiable object state data tracking | |
| Huang et al. | Incentive assignment in PoW and PoS hybrid blockchain in pervasive edge environments | |
| WO2022079431A1 (en) | Block reward management in blockchain | |
| CN111292187B (en) | Blockchain billing personnel qualification competitive choice method | |
| CN116233132B (en) | Energy block chain link point consensus method based on improved Raft consensus mechanism | |
| CN115860739A (en) | Improved cross-chain transaction notary credit sequencing algorithm | |
| CN112036908B (en) | High-credibility scientific and technological service transaction method based on blockchain | |
| CN114584311A (en) | Reputation-based safe dynamic intelligent parking space sharing method | |
| CN114511317A (en) | Block chain public account processing system and method for accounting records | |
| Avunduk et al. | Selection of the Graphics Card to be used in Ethereum Mining with Linear BWM-TOPSIS | |
| CN113992389A (en) | SGX data integrity auditing method based on dynamic frequency table | |
| CN111444280A (en) | Data processing system | |
| CN111431696B (en) | Block chain seal mechanism based on identity | |
| US20230334482A1 (en) | Dynamic Quantum Enabled Method for Large Currency Transaction Exemption using Distributed Hash Chain | |
| CN114493810B (en) | Internet of things data processing method, device and medium |
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 |