CN108989410A - A method of improving block chain throughput efficiency - Google Patents
A method of improving block chain throughput efficiency Download PDFInfo
- Publication number
- CN108989410A CN108989410A CN201810725016.7A CN201810725016A CN108989410A CN 108989410 A CN108989410 A CN 108989410A CN 201810725016 A CN201810725016 A CN 201810725016A CN 108989410 A CN108989410 A CN 108989410A
- Authority
- CN
- China
- Prior art keywords
- local area
- area network
- transaction
- node
- nodes
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1044—Group management mechanisms
-
- 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
-
- 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
- Y04S10/00—Systems supporting electrical power generation, transmission or distribution
- Y04S10/50—Systems or methods supporting the power network operation or management, involving a certain degree of interaction with the load-side end user applications
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Finance (AREA)
- Economics (AREA)
- Computing Systems (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Development Economics (AREA)
- Mathematical Physics (AREA)
- Marketing (AREA)
- Strategic Management (AREA)
- Technology Law (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a kind of methods for improving block chain throughput efficiency, it belongs to computer field, participates in all nodes of common recognition, is randomly divided into different local area network fragments, each local area network fragment is made of multiple nodes, is independent of each other during common recognition between local area network fragment；All nodes for participating in common recognition carry out calculating power dynamic allocation simultaneously, calculate in power dynamic allocation procedure, and user automated randomized can be divided into different local area network fragments, and network members dynamic changes, and the node for being responsible for the network also dynamically changes；User is automated randomized when being divided into different local area network fragments, can publish LAN node, and transaction record result is packaged cochain at this time, and before cochain unconfirmed, and All Activity details is kept in and be settled accounts under the temporary addresses of multiple party signatures.
Description
Technical field
The present invention relates to computer fields, and in particular to a method of improve block chain throughput efficiency.
Background technique
It is applied on existing block chain, often concentrates and be deployed on a main chain, can not optimize in data structure, especially
Be will lead to serious public tragedy in more, the higher situation of frequency of use of application so that many applications due to congestion without
Method operates normally.
It is to find out its cause, block chain handling capacity limits maximum factor, the content of any cochain needs to own on network
Node is reached common understanding.In other words, the time interval generated between two neighboring block depends primarily on a block by block
All nodes receive the required time, and any transaction request/request of data needs magnitude (quantity/calculation power) comparable node to reach
At common recognition.
In view of the above-mentioned problems of the prior art, the design and use experience of present invention combination related fields many years,
It is aided with too strong professional knowledge, a kind of method for improving block chain throughput efficiency is had studied, to overcome drawbacks described above.
Summary of the invention
For the problems of in the prior art, a kind of method improving block chain throughput efficiency provided by the invention,
The local division mode of node can be combined and be dynamically distributed with clearing under chain by a kind of, improve the effect of handling up of block chain
Rate.
To achieve the goals above, The technical solution adopted by the invention is as follows: a kind of side for improving block chain throughput efficiency
Method participates in all nodes of common recognition, is randomly divided into different local area network fragments, each local area network fragment is by multiple node groups
At being independent of each other during common recognition between local area network fragment；
All nodes for participating in common recognition carry out calculating power dynamic allocation simultaneously, calculate in power dynamic allocation procedure, Yong Huhui
Automated randomized to be divided into different local area network fragments, network members dynamic changes, and the node for being responsible for the network also dynamically becomes
More；
User's bilateral transaction process is retained in temporary address, is divided into different local area network fragments when user is automated randomized
When, LAN node can be published, transaction record result is packaged cochain at this time, and before cochain unconfirmed, by All Activity
It is settled accounts under the temporary address of the temporary multiple party signatures of process.
When calculating power dynamic allocation as a preferred technical solution, the node of behavior height unification is distributed in different offices
In the net fragment of domain；
User in local area network fragment need to dynamically be flowed in different local area network fragments；
Participate in common recognition number of nodes and calculate power, with the quantity of user in corresponding local area network fragment and trade amount,
The importance of data is relatively etc.；
Same node all should not provide the packaged service of data for a long time for unification user；
For abnormal nodes, one " useless field fragment " need to be provided for verifying the abnormal conditions of abnormal nodes.
User is automated randomized as a preferred technical solution, when being divided into different local area network fragments, and both parties are from same
Belonging to a local area network fragmentation status becomes after belonging to Different LANs fragment, then it is assumed that wherein a player publishes current office
The transaction results clearing of temporary address are submitted cochain by domain net node；
When the node that both parties are responsible for is transferred to other local area network fragments, then it is assumed that both sides publish current office simultaneously
The transaction results clearing of temporary address are submitted cochain by domain net node, the node；
When both parties a wherein side for a long time there is no new transaction, then it is assumed that the counterparty is in " suspend mode shape
State ", for guarantee transaction another party can normal use, therefore, when " suspend mode " be more than certain time, then by the transaction results of the two
Cochain is submitted in clearing；
When both parties still keep active, but bipartite transaction does not occur again for a long time, then it is assumed that transaction pair
Side produces " transaction isolation ", reaches certain time length when " transaction is isolated ", then assert " transaction is isolated " to be permanent sequestration, in order to
Guarantee that the subsequent transaction of both parties is unaffected, cochain is submitted into the transaction results clearing of the two；
As a side of both parties' appearance " by debt ", there is other wholesales expenditure, but due to part property because still retaining
In the case where leading to that Sorry, your ticket has not enough value under the volume " temporary address " of both sides' transaction, need to submit the transaction results clearing of both sides
Cochain.
The vertical management layer of higher level is equipped on the local area network fragment as a preferred technical solution, it is described vertical
The block content that a limited number of nodes upload all local area network fragments is equipped with to management level to verify, and is retained all
The index of block forms the new block chain of " catalogue " rank.
The invention has the beneficial effect that
(1) each local area network fragment of the present invention is made of multiple nodes, between local area network fragment during common recognition mutually
It does not influence.Relative to original full node common recognition scheme, can reach common understanding faster inside each local area network fragment, meanwhile,
Since multiple local area network fragments generate block simultaneously, so the speed of " block out " (generating reliable data block) in the unit time
Degree is also increased.
(2) calculate power dynamic allocation prevents due to each local area network fragment interior joint reduce, malicious node weight increase and
Bring security risk ensure that efficiency and safety under node localization.
(3) final result of multiple transaction record is only packaged cochain by the present invention, and ignores intermediate process of exchange, can be with
Greatly save memory space on chain.
(4) the block content needed for the present invention can be retrieved by " catalogue " after local area network distribution is changed, in addition, should
" catalogue layer " can also serve as the role of verification secondary for block content, and malicious node is attacked caused by preventing because of stochastic problems
Hit successful security risk.
Detailed description of the invention
Fig. 1 is the schematic diagram that the present invention is settled accounts using temporary address；
Specific embodiment
In order to facilitate the understanding of those skilled in the art, the present invention will be further described below with reference to the drawings.
A method of block chain throughput efficiency being improved, since the content of current cochain needs all nodes on network to reach
Common recognition, therefore block chain throughput efficiency has been seriously affected, the present invention passes through all nodes that will participate in common recognition, is randomly divided into not
With local area network fragment, each local area network fragment is made of multiple nodes, between local area network fragment during common recognition mutual not shadow
It rings, relative to original full node common recognition scheme, can reach common understanding faster inside each local area network fragment, simultaneously as
Multiple local area network fragments generate block simultaneously, so the speed of " block out " (generating reliable data block) in the unit time
Increased.
But due to request of data with different participants have it is sporadic (in quantity and time dimension, all without
Method completely predicts the information content of the time that customer transaction occurs and required exchange.Participant is data producer, in block
Under chain, the data that data producer generates are packaged verifying final entry on block chain by node), in order to prevent due to each office
Domain net fragment interior joint is reduced, and malicious node weight increases and bring security risk, is participated in all nodes of common recognition while being needed
It carries out calculating power dynamic allocation, to guarantee the efficiency and safety under node localization, calculate in power dynamic allocation procedure, user can be certainly
Dynamic random division is different local area network fragment, and network members dynamic changes, and the node for being responsible for the network also dynamically changes.
Since in most cases, exchange/transaction of information can be split as multiple bilateral information exchanges.And it is right
In bilateral information exchange, often only need to exchange both sides' Signature Confirmation it may be considered that transaction is errorless.And it is double due to there is transaction
The possibility of Fang Duoci transaction, is packaged cochain, then significant wastage memory space if normal, and if can after multiple transaction most
The fruit that terminates is packaged cochain, and ignores intermediate process of exchange, then can greatly save memory space on chain.User of the present invention is double
Side process of exchange is retained in temporary address, when user is automated randomized is divided into different local area network fragments, can publish local
Transaction record result is packaged cochain at this time by net node, and before cochain unconfirmed, by the temporary multi-party label of All Activity process
It is settled accounts under the temporary address of name, as shown in Figure 1, A, B both sides have frequent transaction always, illustrates that both sides have to a certain extent
" trusting common recognition " exists.Between the two to have traded repeatedly, mutual is paid and income, and the details of these transaction and the two phase
It closes, does not need all to be recorded in publicly-owned block chain.It only needs in due course, repeatedly to trade for the two final
As a result, carrying out plus-minus clearing, the final result of revenue and expenditure between the two is recorded in block chain, not by the account of final cochain
Situation shows as the state of (pending) in processing.
Specifically, the node distribution of behavior height unification of the present invention is broken in different local area networks when calculating power dynamic allocation
In piece；The user in local area network fragment need to dynamically be flowed in different local area network fragments simultaneously；And participate in the node of common recognition
Quantity and calculate power, with the quantity of user in corresponding local area network fragment and the amount traded, the importance of data relatively etc.；Together
One node all should not provide the packaged service of data for a long time for unification user；For abnormal nodes, need to providing one, " useless field is broken
Piece " is used to verify the abnormal conditions of abnormal nodes.
User of the present invention is automated randomized when being divided into different local area network fragments, and several situations will be all packaged below
Chain:
Both parties become after belonging to Different LANs fragment from a local area network fragmentation status is belonged to, then it is assumed that wherein
One player publishes current LAN node, and cochain is submitted in the transaction results clearing of temporary address；
When the node that both parties are responsible for is transferred to other local area network fragments, then it is assumed that both sides publish current office simultaneously
The transaction results clearing of temporary address are submitted cochain by domain net node, the node；
When both parties a wherein side for a long time there is no new transaction, then it is assumed that the counterparty is in " suspend mode shape
State ", for guarantee transaction another party can normal use, therefore, when " suspend mode " be more than certain time, then by the transaction results of the two
Cochain is submitted in clearing；
When both parties still keep active, but bipartite transaction does not occur again for a long time, then it is assumed that transaction pair
Side produces " transaction isolation ", reaches certain time length when " transaction is isolated ", then assert " transaction is isolated " to be permanent sequestration, in order to
Guarantee that the subsequent transaction of both parties is unaffected, cochain is submitted into the transaction results clearing of the two；
As a side of both parties' appearance " by debt ", there is other wholesales expenditure, but due to part property because still retaining
In the case where leading to that Sorry, your ticket has not enough value under " temporary address " of both sides' transaction, need to submit the transaction results clearing of both sides
Chain.
User of the present invention is automated randomized when being divided into different local area network fragments, can with reference to one in above scheme or
Several, but it is including but not limited to several above to settle accounts scheme.
Since we are by whole network structure localization, so, each working node, if without information exchange,
The block content that local area network where then can only all saving oneself forever (local area network where once) is submitted.Calculating power dynamic point
With in the process, in fact it could happen that new user, which enters, oneself is responsible for region, and required historical record is not saved locally, this is just
Lead to not correctly generate credible block, the present invention is equipped with the vertical management of higher level on local area network fragment
Layer, the vertical management layer are equipped with the block content that a limited number of nodes upload all local area network fragments and verify,
And retain the index of all blocks, the new block chain of " catalogue " rank is formed, local area network is retrieved by " catalogue "
Block content needed for after distribution change, in addition, the role of verification secondary for block content can also be served as by being somebody's turn to do " catalogue layer ",
The security risk of malicious node success attack caused by preventing because of stochastic problems.
It should be appreciated that the purposes of these embodiments is merely to illustrate the present invention and is not intended to limit protection model of the invention
It encloses.In addition, it should also be understood that, after reading the technical contents of the present invention, those skilled in the art can be the present invention respectively
Kind change, modification and/or variation, all these equivalent forms equally fall within guarantor defined by the application the appended claims
Within the scope of shield.
Claims (4)
1. a kind of method for improving block chain throughput efficiency, it is characterised in that: all nodes for participating in common recognition are randomly divided into not
With local area network fragment, each local area network fragment is made of multiple nodes, between local area network fragment during common recognition mutual not shadow
It rings；
All nodes for participating in common recognition carry out calculating power dynamic allocation simultaneously, calculate in power dynamic allocation procedure, and user can be automatic
Random division is different local area network fragment, and network members dynamic changes, and the node for being responsible for the network also dynamically changes；
User's bilateral transaction process is retained in temporary address, when user is automated randomized is divided into different local area network fragments,
LAN node can be published, transaction record result is packaged cochain at this time, and before cochain unconfirmed, by All Activity process
It is settled accounts under the temporary address of temporary multiple party signatures.
2. a kind of method for improving block chain throughput efficiency shown according to claim 1, it is characterised in that: calculate power and dynamically distribute
When, the node of behavior height unification distributes in different local area network fragments；
User in local area network fragment need to dynamically be flowed in different local area network fragments；
It participates in the number of nodes of common recognition and calculates power, with the quantity of user in corresponding local area network fragment and the amount of transaction, data
Importance relatively etc.；
Same node all should not provide the packaged service of data for a long time for unification user；
For abnormal nodes, one " useless field fragment " need to be provided for verifying the abnormal conditions of abnormal nodes.
3. a kind of method for improving block chain throughput efficiency according to shown in claim 2, it is characterised in that: user is automated randomized
When being divided into different local area network fragments, both parties become belonging to Different LANs from a local area network fragmentation status is belonged to
After fragment, then it is assumed that wherein a player publishes current LAN node, and the transaction results clearing of temporary address are submitted
Chain；
When the node that both parties are responsible for is transferred to other local area network fragments, then it is assumed that both sides publish current local area network simultaneously
The transaction results clearing of temporary address are submitted cochain by node, the node；
When both parties a wherein side for a long time there is no new transaction, then it is assumed that the counterparty is in " dormant state ",
For guarantee transaction another party can normal use therefore when " suspend mode " is more than certain time, then the transaction results of the two are settled accounts
Submit cochain；
When both parties still keep active, but bipartite transaction does not occur again for a long time, then it is assumed that both parties' production
Life " transaction isolation " assert " transaction is isolated " to be permanent sequestration, then when " transaction is isolated " arrival certain time length in order to guarantee
The subsequent transaction of both parties is unaffected, and cochain is submitted in the transaction results clearing of the two；
As a side of both parties' appearance " by debt ", there is other wholesales expenditure, but due to part property because remaining in double
Cause in the case that Sorry, your ticket has not enough value under the volume " temporary address " just traded, needs to submit the transaction results clearing of both sides
Chain.
4. a kind of method for improving block chain throughput efficiency according to shown in claim 3, it is characterised in that: the local area network is broken
The vertical management layer of higher level is equipped on piece, the vertical management layer is equipped with a limited number of nodes for all local area networks
The block content that fragment uploads is verified, and retains the index of all blocks, forms the new block of " catalogue " rank
Chain.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810725016.7A CN108989410B (en) | 2018-07-04 | 2018-07-04 | Method for improving throughput efficiency of block chain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810725016.7A CN108989410B (en) | 2018-07-04 | 2018-07-04 | Method for improving throughput efficiency of block chain |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108989410A true CN108989410A (en) | 2018-12-11 |
| CN108989410B CN108989410B (en) | 2020-10-30 |
Family
ID=64536101
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810725016.7A Active CN108989410B (en) | 2018-07-04 | 2018-07-04 | Method for improving throughput efficiency of block chain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108989410B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109873808A (en) * | 2019-01-11 | 2019-06-11 | 平安科技（深圳）有限公司 | Communication means and device, storage medium and electronic equipment between block chain node |
| CN111353884A (en) * | 2018-12-20 | 2020-06-30 | 上海智知盾科技有限公司 | Block chain transaction processing method and system |
| CN111506932A (en) * | 2020-06-18 | 2020-08-07 | 海南安迈云网络技术有限公司 | Block chain calculation uplink implementation method |
| CN111932264A (en) * | 2020-10-12 | 2020-11-13 | 南京可信区块链与算法经济研究院有限公司 | Multi-party transaction information consistency maintenance method based on block chain |
| CN112615905A (en) * | 2020-12-03 | 2021-04-06 | 广州智链未来科技有限公司 | Method, device and equipment for scheduling block chain fragments and storage medium |
| CN116777631A (en) * | 2023-08-17 | 2023-09-19 | 腾讯科技（深圳）有限公司 | Transaction uplink method and device based on blockchain, equipment and medium |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106372533A (en) * | 2016-09-14 | 2017-02-01 | ***股份有限公司 | Block chain technology-based content storage method |
| CN106845521A (en) * | 2016-12-23 | 2017-06-13 | 杭州云象网络技术有限公司 | A kind of block chain node clustering method of Behavior-based control time series |
| CN106936589A (en) * | 2017-04-21 | 2017-07-07 | 杭州秘猿科技有限公司 | A kind of acentric the license parallel sharding method of chain and method of commerce |
| CN107196934A (en) * | 2017-05-18 | 2017-09-22 | 电子科技大学 | A kind of cloud data managing method based on block chain |
| CN107330786A (en) * | 2017-05-19 | 2017-11-07 | 杭州云象网络技术有限公司 | A kind of block chain network node communication method based on weight |
| CN107528886A (en) * | 2017-07-25 | 2017-12-29 | 中国科学院计算技术研究所 | Block chain the whole network method for splitting and system |
| CN107612973A (en) * | 2017-08-18 | 2018-01-19 | 暨南大学 | Block chain structure, generation method and transaction verification method for intelligent sliding moved end |
| CN107766540A (en) * | 2017-10-31 | 2018-03-06 | 上海分布信息科技有限公司 | A kind of block chain network of subregion and its method for realizing partitioned storage |
| CN107786642A (en) * | 2017-09-30 | 2018-03-09 | 上海数据交易中心有限公司 | Block chain building method and device, storage medium, server for data circulation |
| US20180101560A1 (en) * | 2016-10-07 | 2018-04-12 | International Business Machines Corporation | Establishing overlay trust consensus for blockchain trust validation system |
-
2018
- 2018-07-04 CN CN201810725016.7A patent/CN108989410B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106372533A (en) * | 2016-09-14 | 2017-02-01 | ***股份有限公司 | Block chain technology-based content storage method |
| US20180101560A1 (en) * | 2016-10-07 | 2018-04-12 | International Business Machines Corporation | Establishing overlay trust consensus for blockchain trust validation system |
| CN106845521A (en) * | 2016-12-23 | 2017-06-13 | 杭州云象网络技术有限公司 | A kind of block chain node clustering method of Behavior-based control time series |
| CN106936589A (en) * | 2017-04-21 | 2017-07-07 | 杭州秘猿科技有限公司 | A kind of acentric the license parallel sharding method of chain and method of commerce |
| CN107196934A (en) * | 2017-05-18 | 2017-09-22 | 电子科技大学 | A kind of cloud data managing method based on block chain |
| CN107330786A (en) * | 2017-05-19 | 2017-11-07 | 杭州云象网络技术有限公司 | A kind of block chain network node communication method based on weight |
| CN107528886A (en) * | 2017-07-25 | 2017-12-29 | 中国科学院计算技术研究所 | Block chain the whole network method for splitting and system |
| CN107612973A (en) * | 2017-08-18 | 2018-01-19 | 暨南大学 | Block chain structure, generation method and transaction verification method for intelligent sliding moved end |
| CN107786642A (en) * | 2017-09-30 | 2018-03-09 | 上海数据交易中心有限公司 | Block chain building method and device, storage medium, server for data circulation |
| CN107766540A (en) * | 2017-10-31 | 2018-03-06 | 上海分布信息科技有限公司 | A kind of block chain network of subregion and its method for realizing partitioned storage |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111353884A (en) * | 2018-12-20 | 2020-06-30 | 上海智知盾科技有限公司 | Block chain transaction processing method and system |
| CN111353884B (en) * | 2018-12-20 | 2024-05-03 | 上海智知盾科技有限公司 | Block chain transaction processing method and system |
| CN109873808A (en) * | 2019-01-11 | 2019-06-11 | 平安科技（深圳）有限公司 | Communication means and device, storage medium and electronic equipment between block chain node |
| CN111506932A (en) * | 2020-06-18 | 2020-08-07 | 海南安迈云网络技术有限公司 | Block chain calculation uplink implementation method |
| CN111932264A (en) * | 2020-10-12 | 2020-11-13 | 南京可信区块链与算法经济研究院有限公司 | Multi-party transaction information consistency maintenance method based on block chain |
| CN112615905A (en) * | 2020-12-03 | 2021-04-06 | 广州智链未来科技有限公司 | Method, device and equipment for scheduling block chain fragments and storage medium |
| CN112615905B (en) * | 2020-12-03 | 2022-09-20 | 广州智链未来科技有限公司 | Method, device and equipment for scheduling block chain fragments and storage medium |
| CN116777631A (en) * | 2023-08-17 | 2023-09-19 | 腾讯科技（深圳）有限公司 | Transaction uplink method and device based on blockchain, equipment and medium |
| CN116777631B (en) * | 2023-08-17 | 2023-11-24 | 腾讯科技（深圳）有限公司 | Transaction uplink method and device based on blockchain, equipment and medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108989410B (en) | 2020-10-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108989410A (en) | A method of improving block chain throughput efficiency | |
| CN108717630B (en) | Block output method and implementation system thereof | |
| CN109150972B (en) | Working method of consensus mechanism of double-layer partitioned efficient block chain | |
| CN110868441B (en) | Block chain public link maintenance method and device, node and block chain public link | |
| KR101827373B1 (en) | Block window module having agreement algorithm for limiting mining, managing server and virtual money exchange system and method | |
| CN109508968A (en) | Block catenary system and its control method | |
| CN108805627B (en) | Media resource allocation method, device, system, medium and equipment | |
| TW202016818A (en) | Blockchain transaction method and device | |
| CN107480990A (en) | Block chain bookkeeping methods and device | |
| CN109118230B (en) | Information processing method and device based on block chain | |
| CN108199842A (en) | The method and system of information is announced in delay | |
| CN109743182B (en) | Intelligent contract approval method and system based on block chain | |
| CN111556049B (en) | Block chain privacy protection method based on group isolation of consensus nodes | |
| Smys et al. | Data elimination on repetition using a blockchain based cyber threat intelligence | |
| CN114745140B (en) | Urban planning field block chain consensus verification method and system based on aggregation encryption | |
| CN110400218A (en) | Layering common recognition method, block chain data processing system based on the Jury Trial | |
| Zhang et al. | Optimized blockchain sharding model based on node trust and allocation | |
| CN114490020A (en) | Block chain fragmentation method and system and electronic equipment | |
| Messias et al. | Selfish & opaque transaction ordering in the Bitcoin blockchain: the case for chain neutrality | |
| CN114202422A (en) | Block chain fragmentation method, block chain system and cross-fragmentation transaction processing method | |
| CN113269543A (en) | Multilayer mixed transaction capacity expansion system and method for block chain | |
| CN110278091B (en) | Internet of things block chain consensus method | |
| Cartwright et al. | The economics of ransomware attacks on integrated supply chain networks | |
| CN110493323A (en) | Fairness document distribution method, system and storage medium based on block chain | |
| CN112995167A (en) | Kafka mechanism-based power utilization information acquisition method, block chain network and user side |
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 | ||
| CB03 | Change of inventor or designer information | ||
| CB03 | Change of inventor or designer information |
Inventor after: He Pi Inventor after: Wang Yuntao Inventor after: Shi Yuanchun Inventor before: He Pi |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |