CN110287263A - Parallel chain is from knowing together method, equipment and storage medium - Google Patents
Parallel chain is from knowing together method, equipment and storage medium Download PDFInfo
- Publication number
- CN110287263A CN110287263A CN201910576869.3A CN201910576869A CN110287263A CN 110287263 A CN110287263 A CN 110287263A CN 201910576869 A CN201910576869 A CN 201910576869A CN 110287263 A CN110287263 A CN 110287263A
- Authority
- CN
- China
- Prior art keywords
- transaction
- parallel chain
- common recognition
- chain
- parallel
- 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Databases & Information Systems (AREA)
- General Physics & Mathematics (AREA)
- Development Economics (AREA)
- Technology Law (AREA)
- General Business, Economics & Management (AREA)
- Strategic Management (AREA)
- Marketing (AREA)
- Computing Systems (AREA)
- Economics (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Memory System Of A Hierarchy Structure (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present invention provides a kind of parallel chain from common recognition method, equipment and storage medium, this method comprises: synchronizing each parallel chain transaction of this parallel chain from main chain block, if there are the non-parallel chain transaction from common recognition transaction in each parallel chain transaction, then judge locally whether be cached with several common recognitions transaction: being, it then sequentially executes and is respectively buffered in local common recognition transaction and the transaction of each parallel chain, the first parallel chain block and corresponding second common recognition transaction are generated, and the second common recognition transaction is sent to main chain node；It is no, then it executes each parallel chain transaction and generates the second parallel chain block and the common recognition transaction of corresponding third, and third common recognition transaction is sent to main chain node；If the transaction of each parallel chain is sequentially cached to local there is no the non-parallel chain transaction from common recognition transaction in each parallel chain transaction.The present invention effectively reduces sky number of blocks.
Description
Technical field
This application involves block chain technical fields, and in particular to a kind of parallel chain is from know together method, equipment and storage medium.
Background technique
Parallel chain common recognition transaction from common recognition transaction to be executed respectively by main chain and parallel chain；Parallel chain common recognition node generates
After common recognition transaction, main chain is sent by common recognition transaction and participates in common recognition；Parallel chain common recognition node will be held by main chain and parallel chain respectively
Capable common recognition transaction retracts this node again and re-executes calculating, generates the common recognition transaction of new block and new block, retransmits new
The common recognition of block, which is traded, gives main chain node.
Based on above-mentioned mechanism, if in the case where not being synchronized to the transaction of common parallel chain always, parallel chain common recognition node
Dead zone block and the corresponding common recognition transaction of dead zone block can be generated according to from common recognition transaction, block corresponding common recognition transaction in dead zone is total to by main chain
Again synchronous to generate new dead zone block by parallel chain common recognition node after knowledge, the common recognition transaction of new block is sent to be received again, is regenerated
New block, circulation goes down to cause to generate a large amount of empty blocks always.
Summary of the invention
In view of drawbacks described above in the prior art or deficiency, be intended to provide a kind of parallel chain for effectively reducing sky number of blocks from
Common recognition method, equipment and storage medium.
In a first aspect, the present invention provides a kind of parallel chain from common recognition method, the above method is suitable for the common recognition section of parallel chain
Point is traded from transaction is known together to be known together respectively by the parallel chain that main chain and parallel chain execute, and the above method includes:
Each parallel chain transaction of this parallel chain is synchronized from main chain block；
Judged in each parallel chain transaction with the presence or absence of non-according to the transaction head information that each parallel chain is traded from transaction of knowing together
Parallel chain transaction:
It is then to judge whether there is several the first common recognition transaction for being buffered in the first local block:
It is then sequentially to execute each first common recognition transaction and the transaction of each parallel chain to generate the first parallel chain block and first flat
Second common recognition transaction of row chain block, and the second common recognition transaction is sent to main chain node；
It is no, then it executes each parallel chain transaction and is handed over the third common recognition for generating the second parallel chain block and the second parallel chain block
Easily, and by third common recognition transaction it is sent to main chain node；
It is no, then the transaction of each parallel chain is sequentially cached to local.
Second aspect, the present invention also provides a kind of equipment, including one or more processors and memory, wherein memory
Comprising can by instruction that the one or more processors execute so that the one or more processors execute it is each according to the present invention
The parallel chain that embodiment provides is from knowing together method.
The third aspect, the present invention also provides a kind of storage medium for being stored with computer program, which makes to count
Calculation machine executes each embodiment provides according to the present invention parallel chain from method of knowing together.
The parallel chain that many embodiments of the present invention provide passes through same from main chain block from know together method, equipment and storage medium
Each parallel chain transaction of this parallel chain is walked, if judging in the transaction of each parallel chain there are the non-parallel chain transaction from common recognition transaction
It is local whether to be cached with several common recognition transaction: it is then sequentially to execute respectively to be buffered in local common recognition transaction and the transaction of each parallel chain,
The first parallel chain block and corresponding second common recognition transaction are generated, and the second common recognition transaction is sent to main chain node；It is no, then it holds
Each parallel chain transaction of row generates the second parallel chain block and the common recognition transaction of corresponding third, and third common recognition transaction is sent to master
Chain node；If the transaction of each parallel chain is sequentially delayed there is no the non-parallel chain transaction from common recognition transaction in each parallel chain transaction
It is stored to local method, effectively reduces sky number of blocks.
The parallel chain that some embodiments of the invention provide further passes through monitoring from know together method, equipment and storage medium and exists
With the presence or absence of the non-parallel chain transaction from common recognition transaction in the continuous main chain block of first quantity: it is no, then sequentially execute each the
One common recognition transaction is traded the 4th common recognition with generating the 4th common recognition transaction of third parallel chain block and third parallel chain block
The method for being sent to main chain node guarantees that parallel chain common recognition node will not the biggish transaction of disposable chain linked to owner node quantity forwarded
Group and cause main chain node trade congestion, to guarantee the stable operation of main chain.
The parallel chain that some embodiments of the invention provide further passes through monitoring from know together method, equipment and storage medium and delays
Whether it is not less than the first threshold of pre-configuration in the presence of the total amount of the first local common recognition transaction: is then sequentially to execute each first to be total to
Transaction is known to generate the 5th common recognition transaction of the 4th parallel sequence block and the 4th parallel sequence block, and the 5th common recognition transaction is sent
To the method for main chain node, guarantee parallel chain common recognition node will not the disposable biggish trading group of chain linked to owner node quantity forwarded and
Lead to the transaction congestion of main chain node, to guarantee the stable operation of main chain.
The parallel chain that some embodiments of the invention provide knows together method, equipment and storage medium further by searching for most certainly
First main chain block corresponding to the 5th newly-generated parallel chain block；The each parallel of this parallel chain is synchronized from the first main chain block
The method of chain transaction guarantees that parallel chain common recognition node will not after delay machine is restarted in several first common recognition process of exchange of local cache
Omit the first common recognition transaction.
Detailed description of the invention
By reading a detailed description of non-restrictive embodiments in the light of the attached drawings below, the application's is other
Feature, objects and advantages will become more apparent upon:
Fig. 1 is a kind of flow chart of the parallel chain that provides of one embodiment of the invention from the method for common recognition.
Fig. 2 is a kind of flow chart of preferred embodiment of method shown in Fig. 1.
Fig. 3 is a kind of flow chart of preferred embodiment of method shown in Fig. 1.
Fig. 4 is the flow chart of step S11 in a kind of preferred embodiment of method shown in Fig. 1.
Fig. 5 is a kind of structural schematic diagram for equipment that one embodiment of the invention provides.
Specific embodiment
The application is described in further detail with reference to the accompanying drawings and examples.It is understood that this place is retouched
The specific embodiment stated is used only for explaining related invention, rather than the restriction to the invention.It also should be noted that in order to
Convenient for description, part relevant to invention is illustrated only in attached drawing.
It should be noted that in the absence of conflict, the features in the embodiments and the embodiments of the present application can phase
Mutually combination.The application is described in detail below with reference to the accompanying drawings and in conjunction with the embodiments.
One block chain transaction can be divided into transaction head information and transaction body, and transaction head information includes purpose actuator name
Claim, type of transaction etc., transaction body can put specific Transaction Information.
Fig. 1 is a kind of flow chart of the parallel chain that provides of one embodiment of the invention from the method for common recognition.As shown in Figure 1, at this
In embodiment, the present invention provides a kind of parallel chain from common recognition method, and the above method is suitable for the common recognition node of parallel chain, from knowing together
Transaction is traded to be known together respectively by the parallel chain that main chain and parallel chain execute, and the above method includes:
S11: each parallel chain transaction of this parallel chain is synchronized from main chain block；
S12: judge to hand over the presence or absence of non-from common recognition in each parallel chain transaction according to the transaction head information that each parallel chain is traded
Easy parallel chain transaction:
It is to then follow the steps S13: judges whether there is several the first common recognition transaction for being buffered in the first local block:
It is to then follow the steps S14: executes each first common recognition transaction and the transaction of each parallel chain sequentially to generate the first parallel chain
Second common recognition transaction of block and the first parallel chain block, and the second common recognition transaction is sent to main chain node；
It is no, it thens follow the steps S15: executing each parallel chain transaction to generate the second parallel chain block and the second parallel chain block
Third know together transaction, and by third common recognition transaction be sent to main chain node；
It is no, it thens follow the steps S16: the transaction of each parallel chain is sequentially cached to local.
Specifically, with the type of transaction of the transaction head information of the non-parallel chain transaction from common recognition transaction for non-commit class
Type, for the type of transaction from the transaction head information of common recognition transaction is commit；Assuming that a, b, c, d are four of parallel chain M flat
Row chain common recognition node, the corresponding main chain node of a are A, and the corresponding main chain node of b is B, and the corresponding main chain node of c is C, and d is corresponding
Main chain node is D；The invasive parallel chain transaction txM for building parallel chain M, the transaction of txM in main chain block 20 (block (20_ master))
The type of transaction of head information is non-commit type；
For this group of main chain node-parallel chain node of A-a:
In step s 11, a synchronizes txM from block (20_ master)；
In step s 12, the transaction head information that a trades according to each parallel chain judges in each parallel chain transaction with the presence or absence of non-
It trades from the parallel chain of common recognition transaction:
Since the type of transaction of the transaction head information of the parallel chain transaction txM in main chain block is non-commit type, it is
The non-parallel chain transaction from common recognition transaction, thens follow the steps S13: judging whether there is and several is buffered in local the first block
First common recognition transaction:
It is local there is no the first common recognition transaction of caching since txM is the transaction for creating parallel chain M, it thens follow the steps
S15: txM is executed to generate the third common recognition transaction tx1_a of the second parallel chain block block (1_a) and block (1_a), and will
Tx1_a is sent to A；
The parallel chain of B-b, C-c, D-d are identical as A-a from common recognition method, and details are not described herein again；
At this point, tx1_a to be broadcast to other nodes of main chain after A receives tx1_a；
After B receives tx1_b, tx1_b is broadcast to other nodes of main chain；
After C receives tx1_c, tx1_c is broadcast to other nodes of main chain；
After D receives tx1_d, tx1_d is broadcast to other nodes of main chain；
All nodes of main chain all receive tx1_a, tx1_b, tx1_c, tx1_d.
Assuming that parallel chain related with the parallel chain M transaction in main chain block 21 (block (21_ master)) is tx1_a, tx1_
b,tx1_c,tx1_d；Tx1_a, tx1_b, tx1_c, tx1_d are from common recognition transaction, the friendship of tx1_a, tx1_b, tx1_c, tx1_d
The type of transaction of easy head information is commit；
For this group of main chain node-parallel chain node of A-a:
In step s 11, a synchronizes each parallel chain transaction of this parallel chain from block (21_ master)；
In step s 12, the transaction head information that a trades according to each parallel chain judges in each parallel chain transaction with the presence or absence of non-
It trades from the parallel chain of common recognition transaction:
Due to the transaction of the transaction head information of parallel chain transaction tx1_a, tx1_b, tx1_c, tx1_d of block (21_ master)
Head information type of transaction be commit, be it is non-from common recognition transaction, then follow the steps S16: by tx1_a, tx1_b, tx1_c,
Tx1_d is sequentially cached to local.
The parallel chain of B-b, C-c, D-d are identical as A-a from common recognition method, and details are not described herein again；
At this point, the local of a, b, c, d are cached with tx1_a, tx1_b, tx1_c, tx1_d.
Assuming that parallel chain related with the parallel chain M transaction in main chain block 22 (block (22_ master)) is txN, txN is
The non-parallel chain transaction from common recognition transaction, the type of transaction of the transaction head information of txN is non-commit；
In step s 11, a synchronizes each parallel chain transaction txN of this parallel chain from (block (22_ master))；
In step s 12, the transaction head information that a trades according to each parallel chain judges in each parallel chain transaction with the presence or absence of non-
It trades from the parallel chain of common recognition transaction:
Since the type of transaction of the transaction head information of txN is non-commit, S13 is thened follow the steps: if judging whether there is
Dry the first common recognition transaction for being buffered in the first local block:
Since the local cache of a has tx1_a, tx1_b, tx1_c, tx1_d, then follow the steps S14: sequentially execute tx1_a,
Tx1_b, tx1_c, tx1_d and txN are handed over the second common recognition for generating the first parallel chain block block (2_a) and block (2_a)
Easy tx2_a, and tx2_a is sent to A.
The parallel chain of B-b, C-c, D-d are identical as A-a from common recognition method, and details are not described herein again.
In parallel chain M, it is likely present e, the non-common recognition node such as f, g, the corresponding main chain node of e is E, the corresponding master of f
Chain node is F, and the corresponding main chain node of g is G, and so on；Non- common recognition node is different from common recognition node, and non-common recognition node executes
Following steps:
Each parallel chain transaction of this parallel chain is synchronized from main chain block；
Judged in each parallel chain transaction with the presence or absence of non-according to the transaction head information that each parallel chain is traded from transaction of knowing together
Parallel chain transaction:
It is then to hold to execute each first common recognition transaction and the transaction of each parallel chain sequentially to generate the first parallel chain block；
It is no, then each parallel chain transaction is executed to generate the second parallel chain block；
It is no, then the transaction of each parallel chain is sequentially cached to local.
In more embodiments, it can also be handed over according to actual needs by the non-parallel chain transaction from common recognition transaction and from common recognition
The type of transaction of easy transaction head information is configured to other different identifiers, it can be achieved that identical technical effect.
Above-described embodiment effectively reduces sky number of blocks.
Fig. 2 is a kind of flow chart of preferred embodiment of method shown in Fig. 1.As shown in Fig. 2, in a preferred embodiment
In, the above method further include:
S21: it monitors in the continuous main chain block of the first quantity with the presence or absence of the non-parallel chain transaction from common recognition transaction:
It is no, it thens follow the steps S22: it is parallel to generate third parallel chain block and third sequentially to execute each first common recognition transaction
4th common recognition transaction of chain block, and the 4th common recognition transaction is sent to main chain node.
Assuming that the first quantity is 50；
In the step s 21, a detection is handed in 50 continuous main chain blocks with the presence or absence of the non-parallel chain from common recognition transaction
It is easy:
It is no, it thens follow the steps S22: it is parallel to generate third parallel chain block and third sequentially to execute each first common recognition transaction
4th common recognition transaction of chain block, and the 4th common recognition transaction is sent to main chain node A.
In more embodiments, other numerical value, such as 100 can also be configured by the first quantity according to actual needs
It is a, 200, it can be achieved that identical technical effect.
Above-described embodiment guarantees that parallel chain common recognition node will not the biggish trading group of disposable chain linked to owner node quantity forwarded
And lead to the transaction congestion of main chain node, to guarantee the stable operation of main chain.
Fig. 3 is a kind of flow chart of preferred embodiment of method shown in Fig. 1.As shown in figure 3, in a preferred embodiment
In, the above method further include:
S31: whether the total amount that monitoring is buffered in the first local common recognition transaction is not less than the first threshold of pre-configuration:
It is to then follow the steps S32: executes each first common recognition transaction sequentially to generate the 4th parallel sequence block and the 4th in parallel
5th common recognition transaction of chain block, and the 5th common recognition transaction is sent to main chain node.
Assuming that configuring 8 for first threshold；
In step S31, whether the total amount that a monitoring is buffered in the first local common recognition transaction is not less than 8:
It is to then follow the steps S32, a executes each first common recognition transaction sequentially to generate the 4th parallel sequence block and Siping City
5th common recognition transaction of row chain block, and the 5th common recognition transaction is sent to main chain node A.
Wherein, to guarantee node after delay machine, the total amount of the first common recognition transaction still can be monitored, local by being buffered in
Each first common recognition transaction backups in local data base；When node delay machine and reconnection, obtained from local data base not sent
Common recognition transaction, and execute the above method.
In more embodiments, other numerical value, such as 5,10 can also be configured by first threshold according to actual needs, it can
Realize identical technical effect.
Above-described embodiment guarantees that parallel chain common recognition node will not the biggish trading group of disposable chain linked to owner node quantity forwarded
And lead to the transaction congestion of main chain node, to guarantee the stable operation of main chain.
Fig. 4 is the flow chart of step S11 in a kind of preferred embodiment of method shown in Fig. 1.As shown in figure 4, excellent one
It selects in embodiment, step S11 includes:
S112: the first main chain block corresponding to the 5th parallel chain block being newly generated is inquired；
S114: each parallel chain transaction of this parallel chain is synchronized from the first main chain block.
Assuming that there is following application scenarios, the 5th parallel chain block that a is newly generated is block (5_a), and block (5_a) is right
The the first main chain block answered is block (50_ master)；A delay machine before generating block (6_a), after a period of time, a and A reconnection；This
When, a is lost the first common recognition transaction of several first blocks that block (5_a) is cached afterwards due to delay machine；Execute following steps
It can solve the problems, such as that this application scenarios generates；
In step S112, the first main chain corresponding to the 5th parallel chain block block (5_a) that a inquiry is newly generated
Block block (50_ master)；
In step S114, a synchronizes each parallel chain transaction of this parallel chain from block (50_ master).
Above-described embodiment guarantees that parallel chain common recognition node delay machine in several first common recognition process of exchange of local cache is restarted
After will not omit the first common recognition transaction.
Fig. 5 is a kind of structural schematic diagram for equipment that one embodiment of the invention provides.
As shown in figure 5, present invention also provides a kind of equipment 500, including one or more centres as on the other hand
Unit (CPU) 501 is managed, can be added according to the program being stored in read-only memory (ROM) 502 or from storage section 508
The program that is downloaded in random access storage device (RAM) 503 and execute various movements appropriate and processing.In RAM503, also deposit
It contains equipment 500 and operates required various programs and data.CPU501, ROM502 and RAM503 pass through the phase each other of bus 504
Even.Input/output (I/O) interface 505 is also connected to bus 504.
I/O interface 505 is connected to lower component: the importation 506 including keyboard, mouse etc.；It is penetrated including such as cathode
The output par, c 507 of spool (CRT), liquid crystal display (LCD) etc. and loudspeaker etc.；Storage section 508 including hard disk etc.；
And the communications portion 509 of the network interface card including LAN card, modem etc..Communications portion 509 via such as because
The network of spy's net executes communication process.Driver 510 is also connected to I/O interface 505 as needed.Detachable media 511, such as
Disk, CD, magneto-optic disk, semiconductor memory etc. are mounted on as needed on driver 510, in order to read from thereon
Computer program be mounted into storage section 508 as needed.
Particularly, in accordance with an embodiment of the present disclosure, the parallel chain of any of the above-described embodiment description can be by from common recognition method
It is embodied as computer software programs.For example, embodiment of the disclosure includes a kind of computer program product comprising visibly wrap
Containing computer program on a machine-readable medium, the computer program includes the journey for executing parallel chain from the method for common recognition
Sequence code.In such embodiments, which can be downloaded and installed from network by communications portion 509,
And/or it is mounted from detachable media 511.
As another aspect, present invention also provides a kind of computer readable storage medium, the computer-readable storage mediums
Matter can be computer readable storage medium included in the device of above-described embodiment；It is also possible to individualism, it is unassembled
Enter the computer readable storage medium in equipment.Computer-readable recording medium storage has one or more than one program, should
Program is used to execute by one or more than one processor is described in the parallel chain of the application from common recognition method.
Flow chart and block diagram in attached drawing are illustrated according to the system of various embodiments of the invention, method and computer journey
The architecture, function and operation in the cards of sequence product.In this regard, each box in flowchart or block diagram can generation
A part of one module, program segment or code of table, a part of the module, program segment or code include one or more use
The executable instruction of the logic function as defined in realizing.It should also be noted that in some implementations as replacements, being marked in box
The function of note can also occur in a different order than that indicated in the drawings.For example, two boxes succeedingly indicated are actually
It can be basically executed in parallel, they can also be executed in the opposite order sometimes, this is depending on related function.Also it wants
It is noted that the combination of each box in block diagram and or flow chart and the box in block diagram and or flow chart, Ke Yitong
The dedicated hardware based system of functions or operations as defined in executing is crossed to realize, or by specialized hardware and can be calculated
The combination of machine instruction is realized.
Being described in the embodiment of the present application involved unit or module can be realized by way of software, can also be with
It is realized by way of hardware.Described unit or module also can be set in the processor, for example, each unit can
To be the software program being arranged in computer or intelligent movable equipment, it is also possible to the hardware device being separately configured.Wherein, this
The title of a little units or module does not constitute the restriction to the unit or module itself under certain conditions.
Above description is only the preferred embodiment of the application and the explanation to institute's application technology principle.Those skilled in the art
Member is it should be appreciated that invention scope involved in the application, however it is not limited to technology made of the specific combination of above-mentioned technical characteristic
Scheme, while should also cover in the case where not departing from the application design, appointed by above-mentioned technical characteristic or its equivalent feature
Other technical solutions of meaning combination and formation.Such as features described above and (but being not limited to) disclosed herein have similar functions
Technical characteristic replaced mutually and the technical solution that is formed.
Claims (6)
- A kind of method 1. parallel chain is known together certainly, which is characterized in that the method is suitable for the common recognition node of parallel chain, hands over from common recognition Easily trade to be known together respectively by the parallel chain that main chain and parallel chain execute, which comprisesEach parallel chain transaction of this parallel chain is synchronized from main chain block；Judge to hand over the presence or absence of non-from common recognition in each parallel chain transaction according to the transaction head information of each parallel chain transaction Easy parallel chain transaction:It is then to judge whether there is several the first common recognition transaction for being buffered in the first local block:It is to execute each first common recognition transaction and each parallel chain transaction sequentially then to generate the first parallel chain block and institute The second common recognition transaction of the first parallel chain block is stated, and the second common recognition transaction is sent to main chain node；It is no, then it is total with the third for generating the second parallel chain block and the second parallel chain block to execute each parallel chain transaction Know transaction, and third common recognition transaction is sent to the main chain node；It is no, then each parallel chain transaction is sequentially cached to local.
- 2. the method according to claim 1, wherein further include:It monitors in the continuous main chain block of the first quantity with the presence or absence of the non-parallel chain transaction from common recognition transaction: it is no, then it presses Sequence is executed each first common recognition transaction and is handed over the 4th common recognition for generating third parallel chain block and the third parallel chain block Easily, and by the 4th common recognition transaction it is sent to the main chain node.
- 3. the method according to claim 1, wherein further include:Whether the total amount that monitoring is buffered in the first local common recognition transaction is not less than the first threshold of pre-configuration:It is to execute each first common recognition transaction sequentially then to generate the 4th parallel sequence block and the 4th parallel sequence block 5th common recognition transaction, and the 5th common recognition transaction is sent to the main chain node.
- 4. the method according to claim 1, wherein each parallel chain for synchronizing this parallel chain from main chain block Transaction includes:Search the first main chain block corresponding to the 5th parallel chain block being newly generated；Each parallel chain transaction of this parallel chain is synchronized from the first main chain block.
- 5. a kind of equipment, which is characterized in that the equipment includes:One or more processors；Memory, for storing one or more programs,When one or more of programs are executed by one or more of processors, so that one or more of processors Execute such as method of any of claims 1-4.
- 6. a kind of storage medium for being stored with computer program, which is characterized in that realize when the program is executed by processor as weighed Benefit requires method described in any one of 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910576869.3A CN110287263B (en) | 2019-06-28 | 2019-06-28 | Parallel chain self-consensus method, device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910576869.3A CN110287263B (en) | 2019-06-28 | 2019-06-28 | Parallel chain self-consensus method, device and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110287263A true CN110287263A (en) | 2019-09-27 |
| CN110287263B CN110287263B (en) | 2021-03-16 |
Family
ID=68019521
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910576869.3A Active CN110287263B (en) | 2019-06-28 | 2019-06-28 | Parallel chain self-consensus method, device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110287263B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111242780A (en) * | 2020-01-12 | 2020-06-05 | 杭州复杂美科技有限公司 | Method, device and storage medium for sending consensus transaction |
| CN112184227A (en) * | 2020-09-30 | 2021-01-05 | 杭州复杂美科技有限公司 | Parallel chain supervision consensus method, equipment and storage medium |
| CN112733202A (en) * | 2021-01-11 | 2021-04-30 | 杭州复杂美科技有限公司 | Parallel chain supervision consensus method, computer device and storage medium |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107124403A (en) * | 2017-04-14 | 2017-09-01 | 朱清明 | The generation method and computing device of common recognition block in block chain |
| CN108985772A (en) * | 2018-07-02 | 2018-12-11 | 上海达家迎信息科技有限公司 | A kind of verification method, device, equipment and the storage medium of block chain |
| CN109101662A (en) * | 2018-09-18 | 2018-12-28 | 百度在线网络技术（北京）有限公司 | Block generation method, device, equipment and storage medium |
| CN109271446A (en) * | 2018-08-30 | 2019-01-25 | 杭州复杂美科技有限公司 | A kind of parallel chain method of data synchronization, equipment and storage medium |
| CN109410045A (en) * | 2018-08-30 | 2019-03-01 | 杭州复杂美科技有限公司 | A kind of parallel chain common recognition method, equipment and storage medium |
| US20190081793A1 (en) * | 2017-09-12 | 2019-03-14 | Kadena, LLC | Parallel-chain architecture for blockchain systems |
| CN109508982A (en) * | 2018-11-21 | 2019-03-22 | 北京蓝石环球区块链科技有限公司 | REPB common recognition based on the more subchains of block chain main chain adduction row |
| CN109831514A (en) * | 2019-03-02 | 2019-05-31 | 杭州复杂美科技有限公司 | Parallel chain common recognition method, data exception processing method, equipment and storage medium |
| CN109886693A (en) * | 2019-03-13 | 2019-06-14 | 百度在线网络技术（北京）有限公司 | Common recognition implementation method, device, equipment and the medium of block catenary system |
-
2019
- 2019-06-28 CN CN201910576869.3A patent/CN110287263B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107124403A (en) * | 2017-04-14 | 2017-09-01 | 朱清明 | The generation method and computing device of common recognition block in block chain |
| US20190081793A1 (en) * | 2017-09-12 | 2019-03-14 | Kadena, LLC | Parallel-chain architecture for blockchain systems |
| CN108985772A (en) * | 2018-07-02 | 2018-12-11 | 上海达家迎信息科技有限公司 | A kind of verification method, device, equipment and the storage medium of block chain |
| CN109271446A (en) * | 2018-08-30 | 2019-01-25 | 杭州复杂美科技有限公司 | A kind of parallel chain method of data synchronization, equipment and storage medium |
| CN109410045A (en) * | 2018-08-30 | 2019-03-01 | 杭州复杂美科技有限公司 | A kind of parallel chain common recognition method, equipment and storage medium |
| CN109101662A (en) * | 2018-09-18 | 2018-12-28 | 百度在线网络技术（北京）有限公司 | Block generation method, device, equipment and storage medium |
| CN109508982A (en) * | 2018-11-21 | 2019-03-22 | 北京蓝石环球区块链科技有限公司 | REPB common recognition based on the more subchains of block chain main chain adduction row |
| CN109831514A (en) * | 2019-03-02 | 2019-05-31 | 杭州复杂美科技有限公司 | Parallel chain common recognition method, data exception processing method, equipment and storage medium |
| CN109886693A (en) * | 2019-03-13 | 2019-06-14 | 百度在线网络技术（北京）有限公司 | Common recognition implementation method, device, equipment and the medium of block catenary system |
Non-Patent Citations (1)
| Title |
|---|
| 白杰等: "发布区块链标准应用模型及应用部署技术研究", 《信息技术与网络安全》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111242780A (en) * | 2020-01-12 | 2020-06-05 | 杭州复杂美科技有限公司 | Method, device and storage medium for sending consensus transaction |
| CN112184227A (en) * | 2020-09-30 | 2021-01-05 | 杭州复杂美科技有限公司 | Parallel chain supervision consensus method, equipment and storage medium |
| CN112184227B (en) * | 2020-09-30 | 2023-05-30 | 杭州复杂美科技有限公司 | Parallel chain supervision consensus method, device and storage medium |
| CN112733202A (en) * | 2021-01-11 | 2021-04-30 | 杭州复杂美科技有限公司 | Parallel chain supervision consensus method, computer device and storage medium |
| CN112733202B (en) * | 2021-01-11 | 2022-09-13 | 杭州复杂美科技有限公司 | Parallel chain supervision consensus method, computer device and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110287263B (en) | 2021-03-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109587271A (en) | Main chain parallel chain architecture system and block synchronous method, equipment and storage medium | |
| Narasimha et al. | An ant colony optimization technique for solving min–max multi-depot vehicle routing problem | |
| CN109271446A (en) | A kind of parallel chain method of data synchronization, equipment and storage medium | |
| CN110287263A (en) | Parallel chain is from knowing together method, equipment and storage medium | |
| US9852204B2 (en) | Read-only operations processing in a paxos replication system | |
| US10284623B2 (en) | Optimized browser rendering service | |
| CN108984662A (en) | A kind of block chain method of data synchronization | |
| CN106294772B (en) | The buffer memory management method of distributed memory columnar database | |
| CN109831514A (en) | Parallel chain common recognition method, data exception processing method, equipment and storage medium | |
| Wang et al. | An XGBoost-enhanced fast constructive algorithm for food delivery route planning problem | |
| CN110442579A (en) | A kind of State Tree date storage method, synchronous method and equipment and storage medium | |
| CN109377365A (en) | A kind of assets transfer method, equipment and storage medium | |
| CN110489413A (en) | A kind of storage of transaction record, querying method and system, equipment and storage medium | |
| CN110287196A (en) | Block storage method, parallel chain transaction acquisition methods, equipment and storage medium | |
| CN109558454A (en) | Parallel chain digs mine common recognition method, equipment and storage medium | |
| CN109145188A (en) | For searching for the method, equipment and computer readable storage medium of block chain data | |
| Zhang et al. | Recognizing patterns in streams with imprecise timestamps | |
| CN109450659A (en) | Block delayed broadcast method, equipment and storage medium | |
| CN109669789A (en) | Transaction queuing strategy, trading pit storage method, equipment and storage medium | |
| CN110210972A (en) | Common recognition transaction sending method, equipment and storage medium | |
| CN109493015A (en) | A kind of assets transfer method, equipment and storage medium | |
| US20240104031A1 (en) | Forwarding incoming io to scm namespaces | |
| CN110298756A (en) | Parallel chain is from knowing together method, equipment and storage medium | |
| US20140379892A1 (en) | Sorted event monitoring by context partition | |
| Chen et al. | Heuristics for the stochastic/dynamic user-optimal route choice problem |
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 | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20210422 Address after: Room 408, building 13, Tengfei science and Technology Park, 388 Xinping street, Suzhou Industrial Park, Suzhou area, China (Jiangsu) pilot Free Trade Zone, Suzhou 215123, Jiangsu Province Patentee after: Suzhou Jiaoda Chain Technology Co.,Ltd. Patentee after: HANGZHOU FUZAMEI TECHNOLOGY Co.,Ltd. Address before: 310000 Room 702, 7th Floor, Building 6, East Software Park, No. 90 Wensan Road, Xihu District, Hangzhou City, Zhejiang Province Patentee before: HANGZHOU FUZAMEI TECHNOLOGY Co.,Ltd. |
|
| TR01 | Transfer of patent right |