CN110210972A - Common recognition transaction sending method, equipment and storage medium - Google Patents
Common recognition transaction sending method, equipment and storage medium Download PDFInfo
- Publication number
- CN110210972A CN110210972A CN201910470244.9A CN201910470244A CN110210972A CN 110210972 A CN110210972 A CN 110210972A CN 201910470244 A CN201910470244 A CN 201910470244A CN 110210972 A CN110210972 A CN 110210972A
- Authority
- CN
- China
- Prior art keywords
- height
- common recognition
- node
- chain
- transaction
- 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
- 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
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Engineering & Computer Science (AREA)
- Development Economics (AREA)
- Economics (AREA)
- Marketing (AREA)
- Strategic Management (AREA)
- Technology Law (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present invention provides a kind of common recognition transaction sending method, equipment and storage medium, common recognition node suitable for parallel chain, first height is successfully by the parallel chain block height of main chain is packaged and is executed common recognition transaction or common recognition trading group, second height is the common recognition height of parallel chain, this method comprises: judging whether the first height of present node is greater than the second height: being, then stop chain linked to owner node and sends common recognition transaction or common recognition trading group, until the first height of present node is equal to the method for the second height, guarantee that the first height just sends common recognition transaction or common recognition trading group with the second height in the synchronous case, reduce the expenditure of service charge.
Description
Technical field
This application involves block chain technical fields, and in particular to a kind of common recognition transaction sending method, equipment and storage medium.
Background technique
The common recognition node of parallel chain needs to send common recognition transaction to main chain and is packaged and is known together, and common recognition transaction is also required to
Spend service charge；For example, parallel chain common recognition node m chain linked to owner node has sent being total to for the parallel chain block that block height is 100
Know transaction tx100, tx100 to be packaged by main chain node but also not by before knowing together, node m continues to chain linked to owner node and has sent area
The common recognition transaction tx101 for the parallel chain block that block height is 101, causes service charge to waste；The node n in another example parallel chain is known together
It is the new common recognition node that parallel chain is added, since the common recognition height of parallel chain has reached 100, if node n continues tx1
~tx100 chain linked to owner is sent, then causes service charge to waste；
For another example, in existing block chain technology, parallel chain common recognition node is as long as generating a common recognition transaction to master
Chain node is sent, and in order to promote the common recognition efficiency of common recognition transaction, more transactions is packaged into a trading group and are then forwarded to main chain,
In this case, if different main chain nodes generates bifurcated and carries out rollback, parallel chain node follows main chain to carry out rollback, meeting
Cause part common recognition transaction leakage hair, the consequence for causing common recognition to stop.
Summary of the invention
In view of drawbacks described above in the prior art or deficiency, it is intended to provide a kind of common recognition transaction and does not leak hair and save service charge
Common recognition transaction sending method, equipment and storage medium.
In a first aspect, the present invention provides a kind of common recognition transaction sending method, suitable for the common recognition node of parallel chain, first is high
Degree is successfully by the parallel chain block height of main chain is packaged and is executed common recognition transaction or common recognition trading group, and the second height is parallel
The common recognition height of chain, this method comprises:
Judge whether the first height of present node is greater than the second height:
It is then to stop chain linked to owner node to send common recognition transaction or common recognition trading group, until the first height etc. of present node
In the second height.
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 common recognition transaction sending method that embodiment provides.
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 the common recognition transaction sending method that each embodiment provides according to the present invention.
Common recognition transaction sending method, equipment and the storage medium that many embodiments of the present invention provide are by judging present node
First height whether be greater than second height: be then stop chain linked to owner node send common recognition transaction or common recognition trading group, until working as
First height of front nodal point is equal to the method for the second height, guarantees that the first height is just sent in the synchronous case with the second height
Common recognition transaction or common recognition trading group, reduce the expenditure of service charge.
Common recognition transaction sending method that some embodiments of the invention provide, equipment and storage medium further by response to
Rollback occurs for present node, judges whether the third height of present node is greater than the second height: being then to configure third height to
Second height adds one method, so that sending common recognition transaction since the nearest common recognition height of bifurcated height, guarantee is altogether after rollback
Know transaction and does not leak hair.
Common recognition transaction sending method that some embodiments of the invention provide, equipment and storage medium further pass through judgement the
Whether three height are less than the second height: being then to stop chain linked to owner node to send common recognition transaction or common recognition trading group, by third height
The method for being configured to the second height plus one has been known together so that the common recognition node that parallel chain is newly added does not repeat the transmission of chain linked to owner node
Common recognition transaction, reduce the expenditure of service charge.
Common recognition transaction sending method that some embodiments of the invention provide, equipment and storage medium further pass through judgement the
Whether three height are greater than the second height plus the sum of one: it is then to stop chain linked to owner node to send common recognition transaction or common recognition trading group, it will
Third height be configured to second height plus one method so that parallel chain know together node in delay machine reconnection main chain, not repeat to
Main chain node sends the common recognition transaction known together, and reduces the expenditure of service charge.
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 for common recognition transaction sending method that one embodiment of the invention provides.
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. 2.
Fig. 4 is a kind of flow chart of preferred embodiment of method shown in Fig. 2.
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.
Fig. 1 is a kind of flow chart for common recognition transaction sending method that one embodiment of the invention provides.As shown in Figure 1, at this
In embodiment, the present invention provides a kind of common recognition transaction sending method, and the first height (H1) success is packaged and is executed by main chain
The parallel chain block height of common recognition transaction or common recognition trading group, the second height (H2) are the common recognition height of parallel chain, the above method
Include:
S12: judge whether the first height of present node is greater than the second height:
It is to then follow the steps S14: stops chain linked to owner node and send common recognition transaction or common recognition trading group, until present node
The first height be equal to second height.
Assuming that there is the first application scenarios, the first application scenarios are as follows:
The common recognition node of parallel chain needs to send common recognition transaction to main chain and is packaged and is known together, and common recognition transaction is also required to
Spend service charge, it is assumed that current parallel chain common recognition node is node a, and the corresponding main chain node of node a is node A；Node a is to master
Common recognition the transaction tx30, tx30 that chain node has sent the parallel chain block that block height is 30 are packaged but also not by main chain node
By before knowing together, node a continues to the common recognition transaction tx31 that the parallel chain block that block height is 31 is had sent to node A, makes
It is wasted at service charge；
The problem that for the first application scenarios, can be solved by step S12, step S14；
In step s 12, node a judges whether H1 is greater than H2:
Since H1 is 31, H2 30, then follow the steps S14: node a stops to send common recognition transaction to node A or common recognition is handed over
Easy group, it is equal to 31 until the H1 of node a is equal to H2.
Above-described embodiment guarantees that the first height just sends common recognition transaction in the synchronous case with the second height or common recognition is handed over
Easy group, reduce the expenditure of service charge.
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, third height (H3) is that the parallel chain block height of common recognition transaction or the minimum of common recognition trading group to be sent to be sent are put down
Row chain block height, the above method further include:
S22: occurring rollback in response to present node, judges whether the third height of present node is greater than the second height:
It is to then follow the steps S24: configures the second height plus one for third height.
Assuming that there is the second application scenarios, the second application scenarios are as follows:
Rollback occurs for main chain node bifurcated, and parallel chain node is caused to ensue rollback.It will be original when main chain node rollback
Data are all erased, it is assumed that the corresponding parallel chain block of block (main _ 60) is (flat _ 45) block, and block (main _ 50) is corresponding
Parallel chain block be block (flat _ 42)；After rollback, the H2 recorded on main chain node is 40；
It, should be since the common recognition transaction that parallel chain block height is 43 according to trading group sending method in the prior art
It sends, i.e., in the prior art, H3 is configured as 43；But due to rollback after, the H2 that records on main chain node is 40, should be from parallel
The common recognition transaction that chain block height is 41 starts to send, i.e., in the technical scheme, H3 is configured as 41；If according to the prior art
In trading group sending method, eventually miss that parallel chain block height is 41, parallel chain block height is 42 to be total in main chain
Know transaction.
The problem that for the second application scenarios, can be solved by step S22, step S24；Assuming that current flat
Row chain knows together node as node b；
In step S22, in response to present node rollback occurs for node b, judges whether the H3 of node b is greater than H2:
Since the H3 of node b is 42, H2 40, H3 is greater than H2, thens follow the steps S24, H3 is configured H2+1 etc. by node b
In 41.
After above-described embodiment makes rollback, common recognition transaction is sent since the nearest common recognition height of bifurcated height, is guaranteed altogether
Know transaction and does not leak hair.
Fig. 3 is a kind of flow chart of preferred embodiment of method shown in Fig. 2.As shown in figure 3, in a preferred embodiment
In, the above method further include:
S32: judge third height whether less than the second height:
It is to then follow the steps S34: stops chain linked to owner node and send common recognition transaction or common recognition trading group, third height is matched
It is set to the second height plus one.
Assuming that there is third application scenarios, third application scenarios are as follows:
Node c is the new common recognition node that parallel chain is added, and the corresponding main chain node of node c is node C；The H3 of node c this
When be 0；Record has the common recognition height of parallel chain on main chain, and the common recognition height of parallel chain is 50, indicates to have in parallel chain other
Chain linked to owner node is transmitted across several common recognition transaction or common recognition trading group, and these common recognition transaction or common recognition trading group to common recognition node
It has been reached common understanding that, if node c sends the common recognition transaction tx1~tx50 to have been known together to node C again, waste service charge.
The problem that for third application scenarios, can be solved by step S32, step S34；
In step s 32, node c judges whether H3 is less than H2:
Since H3 is 0, being less than H2 is 50, thens follow the steps S34, and node c stops to send common recognition transaction or common recognition to node C
Trading group configures H2+1 equal to 51 for H3.
Above-described embodiment makes the common recognition node that parallel chain is newly added not repeat the common recognition that the transmission of chain linked to owner node has been known together
Transaction, reduces the expenditure of service charge.
Fig. 4 is a kind of flow chart of preferred embodiment of method shown in Fig. 2.As shown in figure 4, in a preferred embodiment
In, the above method further include:
S42: judge whether third height is greater than the second height plus the sum of one:
It is to then follow the steps S44: stops chain linked to owner node and send common recognition transaction or common recognition trading group, third height is matched
It is set to the second height plus one.
Assuming that there is the 4th application scenarios, the 4th application scenarios are as follows:
Assuming that current parallel chain common recognition node is node d, the corresponding main chain node of node d is node D；Node d is in delay machine
Before, H2 60；After node d delay machine reconnection main chain, it is found that the H2 on node D has been updated to 63, the H3 of node d should be configured to
64, if node d sends the common recognition transaction tx61~tx63 to have been known together to node D again at this time, waste service charge.
The problem that for four application scenarios, can be solved by step S42, step S44；
In step S42, node d judges whether H3 is greater than H2+1:
Since the H3 of node d is 64, H2+1 61, S44 is thened follow the steps, node d stops to send common recognition friendship to node D
Easy or common recognition trading group configures H2+1 equal to 64 for H3.
Above-described embodiment makes parallel chain common recognition node in delay machine reconnection main chain, and repeatedly the transmission of chain linked to owner node has not been total to
The common recognition of knowledge is traded, and the expenditure of service charge is reduced.
In more embodiments, the problem that for the first application scenarios, the second application scenarios the problem that,
Each scheme that the problem that the problem that third application scenarios, four application scenarios is proposed can carry out any group
It closes.
In a preferred embodiment, the above method further include:
Chain linked to owner node sends the first solicited message for obtaining the first height to obtain the first height；
Chain linked to owner node sends the second solicited message for obtaining the second height to obtain the second height.
In more embodiments, the first height and second can also be obtained by traversal main chain block recorded data
Height is, it can be achieved that identical technical effect.
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, it is all
Such as disk, CD, magneto-optic disk, semiconductor memory are mounted on as needed on driver 510, in order to read from thereon
Computer program out is mounted into storage section 508 as needed.
Particularly, in accordance with an embodiment of the present disclosure, the common recognition transaction sending method of any of the above-described embodiment description can be by
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 common recognition transaction sending method
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 the common recognition transaction sending method for being described in the application by one or more than one processor.
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 (8)
- The sending method 1. a kind of common recognition is traded, which is characterized in that suitable for the common recognition node of parallel chain, the first height is successful quilt The parallel chain block height traded or know together trading group of knowing together that main chain is packaged and executes, the second height are being total to for the parallel chain Know height, which comprisesJudge whether first height of present node is greater than second height:It is then to stop chain linked to owner node to send common recognition transaction or common recognition trading group, until first height etc. of present node In second height.
- 2. the method according to claim 1, wherein third height is the parallel sequence of common recognition transaction to be sent The minimum parallel chain block height of block height or common recognition trading group to be sent, the method also includes:Rollback occurs in response to present node, judges whether the third height of present node is greater than second height:It is then to configure second height plus one for the third height.
- 3. according to the method described in claim 2, it is characterized by further comprising:Judge whether the third height is less than second height:It is then to stop chain linked to owner node to send common recognition transaction or common recognition trading group, configures described second for the third height Height plus one.
- 4. according to the method described in claim 2, it is characterized by further comprising:Judge whether the third height is greater than second height plus the sum of one:It is then to stop chain linked to owner node to send common recognition transaction or common recognition trading group, configures described second for the third height Height plus one.
- 5. method according to claim 1-4, which is characterized in that further include:The first solicited message for obtaining first height is sent to the main chain node to obtain first height；The second solicited message for obtaining second height is sent to the main chain node to obtain second height.
- 6. according to the method described in claim 5, it is characterized in that, the common recognition trading group includes several common recognition transaction, each institute State the block Hash, corresponding flat that common recognition transaction includes the block height of corresponding parallel chain block, corresponding parallel chain block The block of main chain block corresponding to the block height of main chain block corresponding to row chain block, corresponding parallel chain block is breathed out It is uncommon.
- 7. 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-6.
- 8. 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-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910470244.9A CN110210972B (en) | 2019-05-31 | 2019-05-31 | Method, device and storage medium for sending consensus transaction |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910470244.9A CN110210972B (en) | 2019-05-31 | 2019-05-31 | Method, device and storage medium for sending consensus transaction |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110210972A true CN110210972A (en) | 2019-09-06 |
| CN110210972B CN110210972B (en) | 2021-04-13 |
Family
ID=67789904
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910470244.9A Active CN110210972B (en) | 2019-05-31 | 2019-05-31 | Method, device and storage medium for sending consensus transaction |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110210972B (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 |
| CN111275437A (en) * | 2020-01-12 | 2020-06-12 | 杭州复杂美科技有限公司 | Parallel chain consensus method, device and storage medium |
| CN113110934A (en) * | 2021-04-09 | 2021-07-13 | 杭州复杂美科技有限公司 | Parallel chain block generation method, computer device, and storage medium |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160098723A1 (en) * | 2014-10-01 | 2016-04-07 | The Filing Cabinet, LLC | System and method for block-chain verification of goods |
| 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 |
| CN109474676A (en) * | 2018-10-18 | 2019-03-15 | 尚维斯 | A kind of arbitrary node can all form the block chain of alliance's chain or private chain |
| CN109508982A (en) * | 2018-11-21 | 2019-03-22 | 北京蓝石环球区块链科技有限公司 | REPB common recognition based on the more subchains of block chain main chain adduction row |
| CN109584072A (en) * | 2018-11-28 | 2019-04-05 | 杭州复杂美科技有限公司 | A kind of transaction sending method, equipment and the storage medium of parallel chain common recognition |
| CN109587271A (en) * | 2018-12-29 | 2019-04-05 | 杭州复杂美科技有限公司 | Main chain parallel chain architecture system and block synchronous method, equipment and storage medium |
-
2019
- 2019-05-31 CN CN201910470244.9A patent/CN110210972B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160098723A1 (en) * | 2014-10-01 | 2016-04-07 | The Filing Cabinet, LLC | System and method for block-chain verification of goods |
| 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 |
| CN109474676A (en) * | 2018-10-18 | 2019-03-15 | 尚维斯 | A kind of arbitrary node can all form the block chain of alliance's chain or private chain |
| CN109508982A (en) * | 2018-11-21 | 2019-03-22 | 北京蓝石环球区块链科技有限公司 | REPB common recognition based on the more subchains of block chain main chain adduction row |
| CN109584072A (en) * | 2018-11-28 | 2019-04-05 | 杭州复杂美科技有限公司 | A kind of transaction sending method, equipment and the storage medium of parallel chain common recognition |
| CN109587271A (en) * | 2018-12-29 | 2019-04-05 | 杭州复杂美科技有限公司 | Main chain parallel chain architecture system and block synchronous method, equipment and storage medium |
Cited By (4)
| 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 |
| CN111275437A (en) * | 2020-01-12 | 2020-06-12 | 杭州复杂美科技有限公司 | Parallel chain consensus method, device and storage medium |
| CN111275437B (en) * | 2020-01-12 | 2023-05-30 | 杭州复杂美科技有限公司 | Parallel chain consensus method, apparatus and storage medium |
| CN113110934A (en) * | 2021-04-09 | 2021-07-13 | 杭州复杂美科技有限公司 | Parallel chain block generation method, computer device, and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110210972B (en) | 2021-04-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109271446A (en) | A kind of parallel chain method of data synchronization, equipment and storage medium | |
| CN109933592A (en) | Date storage method, data rewind method, equipment and storage medium | |
| CN110210972A (en) | Common recognition transaction sending method, equipment and storage medium | |
| CN109087099A (en) | A kind of privacy method of commerce and system, equipment and storage medium | |
| CN109410045A (en) | A kind of parallel chain common recognition method, equipment and storage medium | |
| CN110113408A (en) | A kind of block synchronous method, equipment and storage medium | |
| CN109587271A (en) | Main chain parallel chain architecture system and block synchronous method, equipment and storage medium | |
| CN109831514A (en) | Parallel chain common recognition method, data exception processing method, equipment and storage medium | |
| CN109584072A (en) | A kind of transaction sending method, equipment and the storage medium of parallel chain common recognition | |
| CN109034801A (en) | A kind of privacy method of commerce and system, equipment and can storage medium | |
| CN110392121A (en) | Parallel chain block generation method, equipment and storage medium | |
| CN109033001A (en) | Method and apparatus for distributing GPU | |
| CN110516150A (en) | Parallel chain transaction method for pushing, equipment and storage medium | |
| CN109377365A (en) | A kind of assets transfer method, equipment and storage medium | |
| CN109558454A (en) | Parallel chain digs mine common recognition method, equipment and storage medium | |
| CN109379418A (en) | Method, equipment and the storage medium of file based on block chain processing business system | |
| US11416510B2 (en) | Systems and methods for applying lifecycle processes to digital data objects utilizing distributed ledger technology and artificial intelligence | |
| CN109542455A (en) | Contract executes method, contract compressing method, equipment and storage medium | |
| CN109447641A (en) | To the method and apparatus of block chain browser transport block chain data | |
| CN109450659A (en) | Block delayed broadcast method, equipment and storage medium | |
| CN109145188A (en) | For searching for the method, equipment and computer readable storage medium of block chain data | |
| CN109903050A (en) | Transaction De-weight method, transaction building method, equipment and storage medium | |
| CN110083745A (en) | Data query method, equipment and storage medium | |
| CN110599166A (en) | Method and device for acquiring transaction dependency relationship in block chain | |
| CN110287263A (en) | Parallel chain is from knowing together method, equipment and storage 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 |