CN105719185B - The data comparison and common recognition method of block chain - Google Patents
The data comparison and common recognition method of block chain Download PDFInfo
- Publication number
- CN105719185B CN105719185B CN201610040598.6A CN201610040598A CN105719185B CN 105719185 B CN105719185 B CN 105719185B CN 201610040598 A CN201610040598 A CN 201610040598A CN 105719185 B CN105719185 B CN 105719185B
- Authority
- CN
- China
- Prior art keywords
- server
- transaction
- cryptographic hash
- block chain
- data
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 20
- 238000013461 design Methods 0.000 claims description 17
- 230000005540 biological transmission Effects 0.000 claims description 11
- 238000004891 communication Methods 0.000 claims description 10
- 230000000694 effects Effects 0.000 claims description 10
- 230000011218 segmentation Effects 0.000 claims description 9
- 230000009466 transformation Effects 0.000 claims description 7
- 239000012634 fragment Substances 0.000 claims description 5
- 241001269238 Data Species 0.000 claims description 3
- 238000012544 monitoring process Methods 0.000 claims description 3
- 238000012856 packing Methods 0.000 claims description 3
- 230000008569 process Effects 0.000 claims description 3
- 238000001514 detection method Methods 0.000 claims description 2
- 238000013507 mapping Methods 0.000 claims description 2
- 230000000750 progressive effect Effects 0.000 claims description 2
- 240000000233 Melia azedarach Species 0.000 claims 1
- 238000012546 transfer Methods 0.000 description 6
- RTZKZFJDLAIYFH-UHFFFAOYSA-N Diethyl ether Chemical compound CCOCC RTZKZFJDLAIYFH-UHFFFAOYSA-N 0.000 description 4
- 230000008901 benefit Effects 0.000 description 3
- 230000008859 change Effects 0.000 description 3
- 238000013500 data storage Methods 0.000 description 3
- 238000007726 management method Methods 0.000 description 3
- 230000005856 abnormality Effects 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 230000018109 developmental process Effects 0.000 description 2
- 239000003814 drug Substances 0.000 description 2
- 239000004744 fabric Substances 0.000 description 2
- 230000001360 synchronised effect Effects 0.000 description 2
- 238000010200 validation analysis Methods 0.000 description 2
- 238000012795 verification Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000001914 filtration Methods 0.000 description 1
- 238000002360 preparation method Methods 0.000 description 1
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 common recognition method of cryptographic Hash calculating the invention discloses the data comparison of block chain and to(for) every transaction content, by converting random number, the a few digits for presetting cryptographic Hash whithin a period of time do not repeat, referred to here as number is not repeated, more different cryptographic Hash makes a reservation for several digits it may determine that being consistent transaction or inconsistent transaction out between Accounting Server.The mode that repeatedly number comparison can establish similar Mei Keer tree compares, because it is not duplicate that the cryptographic Hash of transaction, which arranges several, it can be used as number to use, it can be put by certain rule in class Mei Keer tree, on different Accounting Servers, the position that same transaction cryptographic Hash is put into Mei Keer tree be it is completely the same, can be very fast find out difference, the conveying capacity for reducing data greatly accelerates the time required for common recognition.
Description
Technical field
The present invention relates to Internet technical fields, especially block chain technology.
Background technique
The technical vulnerabilities such as existing bit coin, ether mill, bit stock, auspicious wave coin are as follows:
1, it requires to transmit whole cryptographic Hash when new block transaction data compares, data volume is very big.
2, the duplicate probability of transmission of transaction data is big, and the data oneself lacked are not sure to go for the source of downloading, effect
Rate is not high, and data are not easy completion, has part transaction to have longer delay.
3, bit coin, ether mill, bit stock are that a server is selected to be packaged to broadcast new block, and spread speed is slow, repeatedly
The data volume of transmission is big or to compare very more servers simultaneously as auspicious wave coin to reach common understanding, and reaches common understanding
Time is not fast enough.
4, existing across chain transaction can not veritably across chain transmitting digital cash or digital asset, a kind of only needs
The exchange relationship of intermediary.
5, data storage is flexible not enough, does not carry out the preparation that big data quantity needs to store different server respectively.
Summary of the invention
In order to overcome the above-mentioned deficiencies of the prior art, the data comparison of block chain of the invention and common recognition method, make data
Comparison needs the information transmitted to be greatly reduced, and easily finds out the data of omission, and can Location Request download transactions number
According to scheme of flexibly knowing together can significantly shorten the time that each server is reached common understanding, and across chain Exchange Design makes on block chain
Digital cash and digital asset can really across chain tra nsfer, just as the transfer of cash, not need transfer intermediary, favorably
Bigger effect is being played without field and region in block chain, transaction data can verify by number segmentation is not repeated, be packaged, deposit
Storage can be such that data storage realizes using more schemes, and the development of block even will not be limited by the performance and capacity of server.
The data comparison and common recognition method of block chain, which is characterized in that calculate, lead to for the cryptographic Hash of every transaction content
Cross transformation random number, whithin a period of time preset cryptographic Hash a few digits do not repeat (can be former positions, it is rear several or appoint
Anticipate several combinations, referred to here as not repeating to number), more different cryptographic Hash makes a reservation for several digits and can sentence between Accounting Server
It is disconnected to go out to be consistent transaction or inconsistent transaction, cryptographic Hash here and indicate with 16 systems, conveniently convenient for narration, in addition
It can be obtained by certain front servers and be numbered in order to every transaction affix integer, and enclose the height of new block
Degree, facilitates and judges that transaction data, can be single for the transaction data of the omission of front block by the received time order and function of server
Solely build a group comparison.
User can calculate a batch and not repeat to number, block catenary system can define one or more by transformation random number
Server can be described as preposition node as transaction entrance, and preposition node 1 can take all not repeatedly numbers, or distribution
More preposition nodes take not numbering repeatedly for different segment numbers.
The omission situation of data can be checked using Bloom filter, can be generated in for a period of time by transformation random number
Cryptographic Hash repeat it not in Bloom filter, data can be made to compare front and back after from A server transport to B server
False Rate is reduced to 0(and assumes that data can only omit, and does not have new data and occurs).
Step S1: the data volume N transmitted as needed establishes Bloom filter, design map function or can be used multiple
Mapping function, it is ensured that after adding all cryptographic Hash on Bloom filter, still there are a part of sky, be generally left to few 20% or more
Vacancy be advisable, position of leaving a blank is fewer, and the difficulty for selecting cryptographic Hash is bigger, but position of leaving a blank is more, and the data volume of transmission may will increase.
Step S2: the cryptographic Hash by converting generating random number weigh it will not in the Bloom filter on A server
It is multiple, it up to the 1 of a rare position is added with this in binary digit array every time when adding cryptographic Hash on Bloom filter
The cryptographic Hash added is uniquely corresponding.
Step S3: the whole cryptographic Hash received are all added to Bloom filter (one on empty and A server by server B
Sample), whether consistent, if inconsistent, just the cloth for having added data in B if comparing the Bloom filter that A is filled out after cryptographic Hash with B two
Grand filter is sent to A server.
Step S4: server A receives the Bloom filter (being added to the cryptographic Hash on B server) that B server is sent,
All cryptographic Hash on A server continue to be added on the filter that B is sent, all cryptographic Hash that can fill out new vacancy
It records, these are exactly the data lacked on B server, are sent to B server.
Step S5: step S3 and step S4 is repeated, until the Bloom filter on B server is consistent with A server.
4, if there is the account of public key address more sends undesirable transaction cryptographic Hash, agreement, which is sent, here is handed over
Easily need the amount of money more than minimum amount this amount of money can disappear if system is considered to violate transaction or safety regulation,
If account minimum balance not enough if cannot initiate to trade, for more send it is undesirable transaction cryptographic Hash clothes
Business device can stop manually its service by certain monitoring programme with automatic or manual, can also be by CA certificate center on block chain
It manages, detection service device monitors (trading account public key address or server behind the public key address of violation system operation rule
Public key address), some functions are freezed at notice CA certificate center, also writable blacklist.
5, all Billing services phases, bit stock was that a server is only selected to do record keeping clothes every time before block chain prepares to be packaged
The business phase is then broadcast to other servers, and auspicious wave coin is that all account servers are all compared to each other, the transaction of ambient service device
Transaction cryptographic Hash in cryptographic Hash and oneself server compares, if 80% transaction cryptographic Hash is consistent, is packaged, and then may be used here
To elect several servers (1 combination to whole servers) as common recognition server as needed, every server is fixed
The communication performance of Shi Tongji and other servers, and it is exchanged with each other information, every server can be according to each server communication
Energy information designs the common recognition scheme of different multiple servers combinations, to exclude the poor server of communication performance, take into account
Every server and other it is non-combined in other servers communication performance, it is therefore an objective to be packaged combined common recognition server fast
Degree is fast, and the speed for being broadcast to other newest blocks is fast.
6, different Accounting Servers (or common recognition server) compare if sending transaction cryptographic Hash, need to transmit a large amount of
Data, compare also time-consuming, do not repeat number comparison as long as sending, compared in order after can such as sorting, can also be with
It is put into dictionary map and compares.
7, the segment number for not repeating number can be set, is distributed on different preposition nodes, for example transaction cryptographic Hash starts
First 3(or to indicate segment number with 16 systems: 0,1,2,3,4,5,6,7,8,9, a, b, c, d, e, f) all do not repeat volume
It number will arrive on this preposition node (or several preposition node clusters) and to register, and relevant transaction is sent to other keep accounts and take
Business device surely downloads to 3 in this preposition node one if other account servers lack the transaction for not repeating number of 3 beginnings
What is started does not repeat the transaction of number, by not repeating the segmentation granting of number, had both guaranteed not repeat to number, and can also shunt collection
In the number of taking pressure.
8, the transmission for not repeating to number and downloading of different segment numbers can be sub-server management, be formed in new block
In the process, the unified common recognition of the transaction of same segment number and packing are also feasible, and can establish the class plum gram of independent fragment number
You set, and the class Mei Keer tree root cryptographic Hash of fragment number are calculated, finally in the class Mei Keer tree root using fragment number as leaf node
New class Mei Keer tree is established, and generates class Mei Keer tree root cryptographic Hash, as the cryptographic Hash of entire new block All Activity, no
The case where often will appear same expenditure address with the trade fair of segment number, account server will check that the progressive payment amount of money is not to be exceeded
Account remaining sum, or the case where special server checks same address expenditure is set, and the server for notifying those to be packaged, it hands over
Easy cryptographic Hash sectional is packaged, and can be packaged and store a segmentation or multiple segmentations on an account server, and common recognition is beaten
Packet comparison and hard-disc storage can also be completed with different servers.
9, compare the data difference from preposition node A server transport to record keeping B server, if not repeating to compile using several
Number transmission mode combine, only need to transmit low volume data and can soon find out the data of omission, be step below:
Step S1: the step of according to right 3, special Bloom filter application method, the number of deals that completion is omitted are used
According to when data difference is big, using effect is especially good, this step is optional.
Step S2: the level of class Mei Keer tree is designed according to real trade amount early period, can be examined by nearest transaction stroke count
Consider history (festivals or holidays, last year be of that month, last week on the same day, yesterday, previous hour, 1 minute first, preceding several blocks etc.) transaction pen
Number dynamically adjusts the design capacity for not repeating number of each new block, and the capacity of the design several sections of points of class Mei Keer is (2 n
+ 1 power) -2, lowest level theoretically can at most place the n times side that transaction stroke count is 2.
If as capacity adjusting scheme can be so that a newest block real trade stroke count be more than 2 n times side
80%, the undermost design capacity of class Mei Keer tree of next block can be increased 1 times, to 2 n+1 power, if a newest area
The class Mei Keer tree lowest level design capacity of the 30% of n times side of the real trade stroke count less than 2 of block, next block can reduce 1
Times, to 2 n-1 power.
If the design capacity of this new block is 2 n times side, the number for sharing 2 n times side is optional, establishes one 2 n
The character string of power digit, every is all 0, corresponding with character string position numbering after preposition node is selected and do not numbered repeatedly
Get up, 0 character string of corresponding position is replaced with 1,2 n times orientation character string Position Number is from left to right 0 to (2 n
Power) -1.
Server B also establishes (2 n times sides) position character string StringB as A server, and server receives A clothes
After business device is transmitted through the transaction data come, replaced not repeating the 0 of number position corresponding with character string accordingly with 1.
StringB is sent to A server and compared with StringA by B server, finds out the position of different characters,
This Position Number be exactly trade not repeat number, by these number corresponding datas be sent to B server i.e. completion institute B clothes
The data that business device lacks.
Step S3: class Mei Keer tree data store an array representation, and 0 to (2 n+1 powers) -2 stores lower layer 2
The cryptographic Hash of Hash, (2 n times sides) -1 start to (2 n+1 powers) -2 to store transaction in order again after the series connection of cryptographic Hash
It does not repeat to number, is (2 n times sides) -1 in the difference that class Mei Keer number stores array index and do not repeat to number them, it is not right
The leaf node for the information answered is defaulted as Hash null value.
Step S4: successively calculating combined cryptographic Hash from bottom to top, the cryptographic Hash until calculating root node.
Step S5: the value for the common recognition Accounting Server transmission class Mei Keer tree selected to system, the data volume transmitted every time
Depend on and give bandwidth and round-trip speed, bandwidth should be utilized, reduce compare round-trip number again, it is different only to transmit cryptographic Hash
Cause following one layer or several layers of relevant cryptographic Hash.
Step S6: finding the discrepant cryptographic Hash of lowest level, and the account server lacked can be to there is the preposition of related data
Node or other servers request downloading data to transmit data to the clothes of missing if data and other servers are inconsistent
Device be engaged in by its verification, reinforms oneself after recalculating relevant cryptographic Hash.
Step S7: repeating step S4, S5, S6, excludes the transaction that rate identical as surrounding account server is less than 20%, repeats
Step S4.
Step S8: according to several common recognition Accounting Servers of the election of right item 5, by this several server All Activities
Class Merkel's tree root compare, the block that the same most servers of class Merkel's tree root cryptographic Hash generate is as newest
Block just select one at random if Merkel's tree root cryptographic Hash is all different, other Billing services phases compare class Merkel tree root
Cryptographic Hash is formed if the same if different, just compare class Merkel tree, download different transaction data just as new block
The same new block, or new block is directly downloaded, finally, it can remove the section that class Merkel tree most layer cryptographic Hash is null value
Point regenerates block with smaller capacity.
Not only the transaction of this block chain can build consensus, and transregional piece of chain can also build consensus, and pass through the throwing of block chain
The CA administrative center of ticket power system or block chain highest permission can authorize transregional piece of chain transmitting digital cash or digital asset, very
It can extremely trade between two or more pieces block chain, this is conducive to the specialization of block chain or geographical division of labor, as property right is stepped on
Note, information deposit card, e-commerce, government system, logistics, Internet of Things, supply chain, exchange, bank clearing system, industry, enterprise
Industry (buying, sale, reimbursement), Central Bank, communications and transportation, public utilities payment, medical system (facilitating socialized medicine management), change
The step of packet (can be independent by frequent penny ante) etc., across chain transaction, is as follows:
Step S1: corresponding block chain supervision department authorizes mutually two (such as A and B) or a plurality of chain can transregional piece of chain friendship
Easily, that is, allow digital cash or digital asset on a block chain that can be transferred on another block chain.
Step S2: user opens legal public key address account (as by ca authentication on block chain on A or B block chain
Center certification passes through), during being safety, it is preferred that the public key address on different chains in person that the center CA will need to trade across chain
All it is associated signature authentication, it was demonstrated that the public key address on two different chains is what same people possessed, and was possessed with the center CA
Related CA certificate is respectively written into A and B block chain by permission.The center CA can give user one random number signature, as long as use can be used
Family public key is unlocked, and just illustrates that user is the owner of the public key, while can pass through the validation of information such as sound, video or identity card
The true identity of user.
Step S3: transaction content is that the coin (such as 100) on A block chain is transferred on B block chain, user by user
Transaction content is signed respectively with corresponding private key on A, B block chain or is successively signed.
Step S4: the block chain where oneself public key address account is sent with corresponding public key by user for signature, can also
To be sent to the block chain of counterparty simultaneously, or common signature is dealt into two block chains.
Write-in A block chain is newest after reaching common understanding after the signature of step S5:A block chain account server verifying transaction A or B
Block deducts the coin (such as 100) on user's A public key address, notes down " with paying B block chain public key on A block chain
Location " is here only record, labeled as the coin that cannot be spent again.
The historical record on quite a lot of Accounting Server access A block chain on step S6:B block chain, if discovery is true
There is corresponding across chain Transaction Information in fact, has been labeled as the coin (such as 100) that cannot be spent again, quite a lot of book keeping operation on B block chain
It is same to be intended to increase coin (such as 100) on B block chain client public key address after server is reached common understanding.
Step S7: after the coin on A block chain is transferred on B block chain by user, so that it may directly on B block chain
Businessman (such as public transport company) or other people pay coin.
Step S8: businessman (such as public transport company) or other people can also repeat S1 to S7 step, by coin from B block chain across
Chain is paid to A block chain.
Compared with prior art, the beneficial effects of the invention are as follows the data comparison of block chain of the invention and common recognition method,
Make data comparison that the information transmitted be needed to be greatly reduced, easily finds out the data of omission, and can Location Request downloading
Transaction data, scheme of flexibly knowing together can significantly shorten the time that each server is reached common understanding, and across chain Exchange Design makes area
Digital cash and digital asset on block chain just as the transfer of cash, can not need in transfer really across chain tra nsfer
Be situated between, be conducive to block chain not having to field and region and play bigger effect, transaction data can by do not repeat number segmentation verification,
It is packaged, storage, data storage can be made to realize that the development of block chain will not be limited by the performance of server using more schemes
And capacity.
Detailed description of the invention
Fig. 1 is illustrated how using repeatedly number does not look into benefit missing data；
Fig. 2, which illustrates how to generate, not to be repeated to number；
Fig. 3 is the omission situation that explanation can check data using Bloom filter, can pass through one section of random number of transformation
The cryptographic Hash generated in time repeats it not in Bloom filter；
Fig. 4 illustrates across chain transaction is how to realize；
Fig. 5 illustrates how design class Mei Keer tree；
Fig. 6 is illustrated how through class Mei Keer tree come synchronous abnormality data；
Fig. 7 illustrates how election common recognition server to reach common understanding, and forms new block.
Specific embodiment
Embodiment 1, referring to attached drawing 2:
This example, which illustrates how to generate, not to be repeated to number.
It is assumed that point 0,1,2,3,4,5,6,7,8,9, a, b, c, d, e, f (16 system) number preposition cloud node takes to user
Number.
No. 2 nodes are other than first must be 2, it further provides that second and third position cannot repeat, i.e. 16*16=
256, that is, provide the Transaction Identification Numbers that this node when each block can only send out 256 different numbers most.
User can specify that several transactions sent out are all the 4th transactions of wallet, and system agreement can only be one every time
Transaction comes into force, and overpays problem without worrying.
Transaction is sent as user selects No. 2 nodes, the cryptographic Hash of a batch transaction is just generated, the strokes that first is 2 is handed over
Easily be dealt into No. 2 nodes, 2027-, 2245-, 2246-, 2231-, judge through No. 2 nodes, 2027,2245,2231 by
Other users are selected, and 2246 be vacancy here, and just 2246-, this transaction is sent to account server to preposition cloud node,
Other transaction are deleted.
Additional block height makes account server may determine that issue during transaction data is this block or front
Block issues (but without the transaction of write-in block chain).
For example now new block is 9891, obtains an additional block in the transaction data of preposition cloud node users
Highly, the Bloom filter or class Mei Keer tree of this node of this block can be put into accordingly to compare, but is less than block 9891
The transaction data (but without the transaction of write-in block chain) of label such as block 9890,9889, needs individually to be put into a combination
It goes to compare with other account servers, may insure that newest block transaction data does not have number collision during the comparison process in this way
The case where.
Embodiment 2, referring to Fig. 3:
This example illustrates to check the omission situations of data using Bloom filter, when can be by one section of random number of transformation
The cryptographic Hash of interior generation repeats it not in Bloom filter, can make data after from A server transport to B server before
The False Rate compared afterwards is reduced to 0(and assumes that data can only omit, and does not have new data and occurs).
Step S1: will will transmit that totally 6 cryptographic Hash are to B server from A server here, if the grand filtering group digit of cloth is 16
Position.
Step S2: the cryptographic Hash by converting generating random number weigh it will not in the Bloom filter on A server
It is multiple, it up to the 1 of a rare position is added with this in binary digit array every time when adding cryptographic Hash on Bloom filter
The cryptographic Hash added is uniquely corresponding, and totally 6 cryptographic Hash correspond to different positions by h1, h2, h3, h4, h5, h6, all uniquely maps.
Step S3: the whole cryptographic Hash received are all added to Bloom filter (one on empty and A server by server B
Sample), whether consistent, 2 and d is lacked on comparison result B, scarce if comparing the Bloom filter that A is filled out after cryptographic Hash with B two
Number is sent to the request downloading of A server.
Step S4: step S3 is repeated, until the Bloom filter on B server is consistent with A server.
Embodiment 3, referring to Fig.1:
This example is illustrated how using repeatedly number does not look into benefit missing data.
It is lacked using number correlation data is not repeated, estimates new block transaction stroke count here at 6, setting master serial number amount is
24 powers, are indicated with the front two for cryptographic Hash of trading.
Here sharing 16 numbers (0 to 15) can select, and establish the character string of one 16 entirely " 0 "
StringA16 corresponds number and character string position get up after preposition node A server is selected and do not numbered repeatedly, by
0 character string of corresponding position, 1 replacement, 16 character string Position Numbers are from left to right 0 to 15.Here character string 0,4,7,
A, d, f characters are " 1 ".
Server B also establishes 16 character string StringB16 that one is 0 entirely as A server, and server receives A
After server is transmitted through the transaction data come, replaced not repeating the 0 of number position corresponding with character string accordingly with 1, here
Character string 0,7, a, f characters are " 1 ".
StringB16 is sent to A server and compared with StringA16 by B server, finds out the position of different characters
Set 4, d, this Position Number be exactly trade do not repeat number 4, d, send corresponding datas of these numbers to B server and mend
The data that full institute's B server lacks
Embodiment 4, referring to Fig. 5,6:
This example illustrate how design class Mei Keer tree, and how synchronous abnormality data.
Class Mei Keer tree data store an array representation, and 0 to 14 stores Hash again after the series connection of 2 cryptographic Hash of lower layer
Cryptographic Hash, 15 start to 30 storage transaction in order not repeat to number, and store array index in class Mei Keer number and do not weigh
The difference for numbering them again is 15, is defaulted as Hash null value without the leaf node of corresponding information.
Successively series connection calculates cryptographic Hash, such as 15 and 16 cryptographic Hash string to the class Mei Keer tree of A server two-by-two from bottom to top
There are 1 there are the cryptographic Hash of Hash after the series connection of 7,3 and 4 cryptographic Hash for the cryptographic Hash of Hash after connection, the root until calculating root node
Cryptographic Hash.
After B server receives the data of A, class Mei Keer tree is established as A, and the root for calculating root node always is breathed out
Uncommon value.
This class Merkel tree establish mode and common Merkel tree be it is different, maximum advantage be even if breathe out
The quantity of uncommon value is different, will not change corresponding position of each cryptographic Hash in class Mei Keer tree, all cryptographic Hash are all
It can sit in the right seat, the same position not repeated on the class Mei Keer tree of the cryptographic Hash of number on a different server is all
The same.
Here compare the root cryptographic Hash of two class Mei Keer trees of A, B, it is different, compare its child node, 1 node is inconsistent, and 2
Node is consistent, compares the child node of 1 node, and 3 is consistent, and 4 is inconsistent, compares the child node of 4 nodes, and 9 is consistent, and 10 is inconsistent, than
Consistent compared with the child node under 10 nodes, 21,22 is inconsistent, and the corresponding number that do not repeat of 22 nodes is 7, under the request of A server
Carry the cryptographic Hash for not repeating number 7.
Cryptographic Hash is calculated from the bottom up now, and the cryptographic Hash for not repeating number 7 that new request is come is put into 22,21 and 22
Hash obtains cryptographic Hash and is put into 10 after cryptographic Hash series connection, and the well uncommon value of Hash is put into 4 after 9 and 10 series connection are merged, 3 and 4 strings
Combine and the well uncommon value of rear Hash is put into 1, the good uncommon value of Hash is put into 0 after 1 and 2 series connection are merged, and compares A and B server two
The more cryptographic Hash of class Mei Keer tree be it is consistent, then the data on both sides are completely the same.
Embodiment 5, referring to Fig. 7:
This example illustrates how election common recognition server to reach common understanding, and forms new block.
Several common recognition Accounting Servers are elected to provide common recognition service, by the class Merkel of this several server All Activities
Tree root compares, the block that the same most servers of class Merkel's tree root cryptographic Hash generate as newest block, if
Merkel's tree root cryptographic Hash is all different, just selects one at random, other Billing services phases compare class Merkel tree root cryptographic Hash, if
It is the same, if different, just to compare class Merkel tree just as new block, download different transaction data, it is new as being formed
Block, or new block is directly downloaded, finally, it can remove the node that class Merkel's tree lowest level cryptographic Hash is null value, again
Generate block with smaller capacity.
Embodiment 6, referring to Fig. 4:
This example illustrates how across chain transaction is realized, the transaction of this block chain can build consensus, and transregional piece of chain can also
To build consensus, transregional piece of chain can be authorized by the franchise system of block chain or the CA administrative center of block chain highest permission
Transmit digital cash or digital asset, it might even be possible to trade between two or more pieces block chain, this is conducive to the row of block chain
Division of labor and lines of specialities or geographical division of labor, as property right registration, information deposit card, e-commerce, government system, logistics, Internet of Things, supply chain, friendship
Easy institute, bank clearing system, industry, enterprise's (buying, sale, reimbursement), Central Bank, communications and transportation, public utilities payment, medical department
The step of system (facilitating socialized medicine management), change packet (can be independent by frequent penny ante) etc., across chain transaction, is such as
Under:
Step S1: corresponding block chain supervision department authorizes mutually two (such as A and B) or a plurality of chain can transregional piece of chain friendship
Easily, that is, allow digital cash or digital asset on a block chain that can be transferred on another block chain.
Step S2: user opens legal public key address account (as by ca authentication on block chain on A or B block chain
Center certification passes through), during being safety, it is preferred that the public key address on different chains in person that the center CA will need to trade across chain
All it is associated signature authentication, it was demonstrated that the public key address on two different chains is what same people possessed, and was possessed with the center CA
Related CA certificate is respectively written into A and B block chain by permission.The center CA can give user one random number signature, as long as use can be used
Family public key is unlocked, and just illustrates that user is the owner of the public key, while can pass through the validation of information such as sound, video or identity card
The true identity of user.
Step S3: transaction content is that the coin (such as 100) on A block chain is transferred on B block chain, user by user
Transaction content is signed respectively with corresponding private key on A, B block chain or is successively signed.
Step S4: the block chain where oneself public key address account is sent with corresponding public key by user for signature, can also
To be sent to the block chain of counterparty simultaneously, or common signature is dealt into two block chains.
Write-in A block chain is newest after reaching common understanding after the signature of step S5:A block chain account server verifying transaction A or B
Block deducts the coin (such as 100) on user's A public key address, notes down " with paying B block chain public key on A block chain
Location " is here only record, labeled as the coin that cannot be spent again.
The historical record on quite a lot of Accounting Server access A block chain on step S6:B block chain, if discovery is true
There is corresponding across chain Transaction Information in fact, has been labeled as the coin (such as 100) that cannot be spent again, quite a lot of book keeping operation on B block chain
It is same to be intended to increase coin (such as 100) on B block chain client public key address after server is reached common understanding.
Step S7: after the coin on A block chain is transferred on B block chain by user, so that it may directly on B block chain
Businessman (such as public transport company) or other people pay coin.
Step S8: businessman (such as public transport company) or other people can also repeat S1 to S7 step, by coin from B block chain across
Chain is paid to A block chain.
Claims (8)
1. the data comparison and common recognition method of block chain, which is characterized in that the cryptographic Hash of every transaction content is calculated, is passed through
Convert random number, whithin a period of time preset cryptographic Hash a few digits repeat referred to here as not repeat number, Accounting Server
Between more different cryptographic Hash make a reservation for several digits indicate that be consistent transaction or inconsistent transaction, cryptographic Hash here
It is indicated with 16 systems, it is convenient convenient for narration, it is obtained additionally by certain preposition nodes whole to every transaction affix in order
Number number, and the height of new block is enclosed, facilitate and judges transaction data by the received time order and function of server, for front block
The transaction data of omission individually build group comparison；User calculates a batch and does not repeat to number, block catenary system is fixed by transformation random number
One or more adopted server can be described as preposition node as transaction entrance, and the omission feelings of data are checked using Bloom filter
Condition repeats it not in Bloom filter by the cryptographic Hash that transformation random number generates in for a period of time, services data from A
Device is transferred to the False Rate that front and back is compared after B server and is reduced to 0, it is assumed that and data can only omit, and do not have new data and occur,
Step S1: the data volume N transmitted as needed establishes Bloom filter, design map function or the multiple mapping letters of use
Number, it is ensured that after adding all cryptographic Hash on Bloom filter, still there are a part of vacancy, and position of leaving a blank is fewer, select cryptographic Hash
Difficulty it is bigger, but position of leaving a blank is more, and the data volume of transmission may will increase,
Step S2: the cryptographic Hash by converting generating random number repeat it will not in the Bloom filter on A server, often
It is secondary on Bloom filter add cryptographic Hash when, binary digit array up to the 1 of a rare position be and this addition
Cryptographic Hash is uniquely corresponding,
The whole cryptographic Hash received are all added to Bloom filter by step S3:B server, on the part and A server in vacancy
Equally, whether consistent compare the Bloom filter that A server is filled out after cryptographic Hash with B server two, if inconsistent, just
The Bloom filter that B server has added data is sent to A server,
Step S4:A server receives the Bloom filter that B server is sent, which is added to the Kazakhstan on B server
Uncommon value, continues all cryptographic Hash on A server to be added on the Bloom filter that B server is sent, can fill out all
The cryptographic Hash in upper new vacancy is recorded, these are exactly the data lacked on B server, is sent to B server,
Step S5: step S3 and step S4 is repeated, until the Bloom filter on B server is consistent with A server；
The transmission for not repeating to number and downloading of different segment numbers are sub-server management, in new block forming process, together
The unified common recognition of the transaction of one segment number and packing are also feasible, and establish the class Mei Keer tree of independent fragment number, calculate segmentation
Number class Mei Keer tree root cryptographic Hash, the class Mei Keer tree root of fragment number is finally being established new class plum gram as leaf node
You set, and generate class Mei Keer tree root cryptographic Hash, as the cryptographic Hash of entire new block All Activity, the trade fair of different segment numbers
There is the case where same expenditure address, account server will check that account balance is not to be exceeded in the progressive payment amount of money, or set specially
The server of door checks that the case where same address expenditure, and the server for notifying those to be packaged, transaction cryptographic Hash sectional are packaged,
Or a segmentation or multiple segmentations are packaged and stored on an account server, common recognition is packaged comparison and hard-disc storage is different
Server complete.
2. the data comparison of block chain and common recognition method according to claim 1, which is characterized in that preposition node 1 takes institute
Some does not repeat to number, or more preposition nodes of distribution take not numbering repeatedly for different segment numbers.
3. the data comparison and common recognition method of block chain according to claim 1 or claim 2, which is characterized in that if there is public key
The account of location more sends undesirable transaction cryptographic Hash, and it is more than minimum amount that agreement, which sends transaction to need one, here
The amount of money, if system be considered violate transaction or safety regulation, by this amount of money disappear, if account minimum balance not enough if
It cannot initiate to trade, for more sending the server of undesirable transaction cryptographic Hash, pass through certain monitoring journey
Sequence can stop manually its service with automatic or manual, can also be managed by CA certificate center on block chain, the monitoring of detection service device
To violate system operation rule public key address after the public key address be trading account public key address or server public key address,
Freeze some functions, or write-in blacklist in notice CA certificate center.
4. the data comparison of block chain and common recognition method according to claim 3, which is characterized in that all account servers exist
Block chain elects several servers as common recognition server as needed before preparing packing, and every server timing counts and it
The communication performance of his server, and it is exchanged with each other information, every server can be designed according to each server communication performance information
The common recognition scheme of different multiple servers combinations, will exclude the poor server of communication performance, take into account every server
With other it is non-combined in other servers communication performance, it is therefore an objective to so that combined common recognition server is packaged speed fast, propagate
It is fast to the speed of other newest blocks.
5. according to the data comparison of claim 4 block chain and common recognition method, which is characterized in that if different Accounting Servers are sent
Transaction cryptographic Hash compares, and needs to transmit a large amount of data, compares also time-consuming, is as long as sending not repeat to number to compare
Can, it is compared in order after sequence, or be put into dictionary map and compare.
6. the data comparison of block chain and common recognition method according to claim 5, which is characterized in that setting does not repeat number
1 segment number distributes on different preposition nodes, and start first of transaction cryptographic Hash is 3 or indicates segment number with 16 systems: 0,
2,3,4,5,6,7,8,9, all numbers that do not repeat of a, b, c, d, e, f will arrive this preposition node or several preposition node collection
It is registered on group, and relevant transaction is sent to other account servers, if other account servers lack not repeating for 3 beginnings
The transaction of number surely downloads to the transaction for not repeating number of 3 beginnings in this preposition node one, by not repeating number
Segmentation is provided, and had both been guaranteed not repeat to number, and can also have been shunted the pressure for concentrating the number of taking.
7. the data comparison of block chain and common recognition method according to claim 6, which is characterized in that compare from preposition node A
The data difference of server transport to record keeping B server only needs to transmit if combining using several transmission modes for not repeating number
Low volume data can soon find out the data of omission, be step below:
Step S1: step according to claim 1, the number of deals omitted using special Bloom filter application method, completion
According to, when data difference is big, using effect is especially good, this step be it is optional,
Step S2: the level of class Mei Keer tree is designed according to real trade amount early period, can consider to go through by nearest transaction stroke count
History transaction stroke count dynamically adjusts the design capacity for not repeating number of each new block, designs the appearance of class Mei Keer tree node
Amount is (2 n+1 powers) -2, and lowest level theoretically can at most place the n times side that transaction stroke count is 2, and capacity adjusting scheme is this
Sample: if the real trade stroke count of a newest block is more than the 80% of 2 n times side, the class Mei Keer tree lowest level of next block
Design capacity can be increased 1 times, to 2 n+1 power, if n times side of the real trade stroke count less than 2 of a newest block
30%, the class Mei Keer tree lowest level design capacity of next block can reduce 1 times, to 2 n-1 power, this new block
Design capacity is 2 n times side, and the number for sharing 2 n times side is optional, establishes the character string of one 2 n times orientation number, every all
It is 0, after preposition node is selected and do not numbered repeatedly, number and character string position is mapped, by 0 character of corresponding position
1 replacement of string, 2 n times orientation character string Position Number is from left to right 0 to (2 n times sides) -1,
B server also establishes (2 n times sides) position character string StringB as A server, and server receives A server
After being transmitted through the transaction data come, replaced not repeating the 0 of number position corresponding with character string accordingly with 1；
StringB is sent to A server and compared with StringA by B server, finds out the position of different characters, this position
Set number be exactly trade not repeat number, by these number corresponding datas be sent to B server i.e. completion B server institute
Scarce data,
Step S3: class Mei Keer tree data store an array representation, and 0 to (2 n+1 powers) -2 stores 2 Hash of lower layer
The cryptographic Hash of Hash, (2 n times sides) -1 start to the transaction that (2 n+1 powers) -2 store in order not weigh again after the series connection of value
Multiple number is (2 n times sides) -1 in the difference that class Mei Keer tree stores array index and do not repeat to number them, not corresponding
The leaf node of information is defaulted as Hash null value,
Step S4: successively calculating combined cryptographic Hash from bottom to top, the cryptographic Hash until calculating root node,
Step S5: the value for the common recognition Accounting Server transmission class Mei Keer tree selected to system, the data volume transmitted every time depend on
In bandwidth and round-trip speed, bandwidth should be utilized, reduce compare round-trip number again, under only transmission cryptographic Hash is inconsistent
One layer of face or several layers of relevant cryptographic Hash,
Step S6: finding the discrepant cryptographic Hash of lowest level, and the account server lacked can be to the preposition node for having related data
Or other servers request downloading data transmits data to the server of missing if data and other servers are inconsistent
It allows it to verify, reinforms oneself after recalculating relevant cryptographic Hash,
Step S7: repeating step S4, S5, S6, excludes the transaction that rate identical as surrounding account server is less than 20%, repeats step
S4,
Step S8: electing several common recognition Accounting Servers according to claim 4, by this several server All Activities
Class Mei Keer tree root compares, and the block that the same most servers of class Mei Keer tree root cryptographic Hash generate is as newest
Block just selects one if class Mei Keer tree root cryptographic Hash is all different at random, other account servers compare class Mei Keer tree root
Cryptographic Hash is formed if the same if different, just compare class Mei Keer tree, download different transaction data just as new block
The same new block, or new block is directly downloaded, finally remove the node that class Mei Keer tree lowest level cryptographic Hash is null value, weight
Newly-generated block with smaller capacity.
8. the data comparison of block chain according to claim 7 and common recognition method, which is characterized in that not only this block chain
Transaction can build consensus, and transregional piece of chain can also build consensus, and pass through the franchise system or block chain highest weight of block chain
The CA administrative center of limit can authorize transregional piece of chain transmitting digital cash or digital asset, it might even be possible in two or more pieces block
It trades between chain, the step of this is conducive to the specialization of block chain or geographical division of labor, across chain transaction is as follows:
Step S1: corresponding block chain supervision department authorize mutually A and B two or more pieces chain can transregional piece of chain transaction, that is, permit
Perhaps the digital cash on a block chain or digital asset can be transferred on another block chain,
Step S2: user opens legal public key address account on A or B block chain, is recognized by ca authentication center on block chain
Card passes through, for safety, it is preferred that the center CA all carries out the public key address in person on different chains for needing to trade across chain
It is associated with signature authentication, it was demonstrated that the public key address on two different chains is that same people possesses, and is incited somebody to action with the permission that the center CA is possessed
Related CA certificate is respectively written into A and B block chain,
The center CA gives user one random number signature, as long as can be unlocked with client public key, illustrates that user is possessing for the public key
Person, while passing through the true identity that sound, video or ID card information confirm user,
Step S3: transaction content is that the coin on A block chain is transferred on B block chain by user, user by transaction content A,
Corresponding private key signs respectively or successively signs on B block chain,
Step S4: the block chain where oneself public key address account is sent with corresponding public key by user for signature, sends simultaneously
Two block chains are dealt into the block chain of counterparty, or by common signature,
The new district A block Lian is written after reaching common understanding after the signature of step S5:A block chain account server verifying transaction A or B
Block deducts the coin on user's A public key address, notes down " paying B block chain public key address " on A block chain, is only here
Record, labeled as the coin that cannot be spent again,
The historical record on quite a lot of Accounting Server access A block chain on step S6:B block chain, if discovery has really
Corresponding across chain Transaction Information has been labeled as the coin that cannot be spent again, and quite a lot of Accounting Server is reached common understanding on B block chain
It is afterwards, same to be intended to increase coin on B block chain client public key address,
Step S7: after the coin on A block chain is transferred on B block chain by user, so that it may directly to the businessman on B block chain
Or other people pay coin,
Step S8: businessman or other people can also repeat S1 to S7 step, by coin from across the chain payment of B block chain to A block chain.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610040598.6A CN105719185B (en) | 2016-01-22 | 2016-01-22 | The data comparison and common recognition method of block chain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610040598.6A CN105719185B (en) | 2016-01-22 | 2016-01-22 | The data comparison and common recognition method of block chain |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105719185A CN105719185A (en) | 2016-06-29 |
| CN105719185B true CN105719185B (en) | 2019-02-15 |
Family
ID=56153749
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610040598.6A Active CN105719185B (en) | 2016-01-22 | 2016-01-22 | The data comparison and common recognition method of block chain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105719185B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106886890A (en) * | 2017-02-07 | 2017-06-23 | 杭州秘猿科技有限公司 | A kind of timing transaction execution method based on block chain |
| TWI728692B (en) | 2019-06-28 | 2021-05-21 | 開曼群島商創新先進技術有限公司 | Method and device for sending certifiable messages across chains |
Families Citing this family (227)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106157142A (en) * | 2016-06-30 | 2016-11-23 | 惠众商务顾问（北京）有限公司 | A kind of block chain common recognition and synchronous method, system and device |
| CN106126722B (en) * | 2016-06-30 | 2019-10-18 | 中国科学院计算技术研究所 | A Verification-Based Prefix Mixing Tree and Its Design Method |
| US10454765B2 (en) * | 2016-07-15 | 2019-10-22 | Mastercard International Incorporated | Method and system for node discovery and self-healing of blockchain networks |
| CN106251216B (en) * | 2016-07-18 | 2020-12-25 | 恒宝股份有限公司 | Method and system for relieving storage pressure of node |
| CN106228344A (en) * | 2016-07-28 | 2016-12-14 | 杭州云象网络技术有限公司 | A kind of electronic government affairs system building method based on block chain technology |
| EP4528620A3 (en) * | 2016-07-29 | 2025-04-30 | nChain Licensing AG | Blockchain-implemented method and system |
| GB201613174D0 (en) * | 2016-07-29 | 2016-09-14 | Eitc Holdings Ltd | Computer-implemented system and method |
| CN106296191A (en) * | 2016-08-13 | 2017-01-04 | 深圳市樊溪电子有限公司 | A kind of PoW common recognition mechanism of block chain power-aware |
| CN106354994B (en) * | 2016-08-22 | 2019-01-18 | 布比（北京）网络技术有限公司 | Handle the method and system of medical data |
| CN106357612B (en) * | 2016-08-25 | 2019-07-16 | 江苏通付盾科技有限公司 | Authentication record checking method and device based on publicly-owned block chain |
| CN106445711B (en) * | 2016-08-28 | 2019-04-30 | 杭州云象网络技术有限公司 | A kind of Byzantine failure tolerance common recognition method applied to block chain |
| CN111083220B (en) * | 2016-08-29 | 2022-08-12 | 中国银联股份有限公司 | Methods of delivering financial services applications |
| CN107800733B (en) * | 2016-08-31 | 2021-01-15 | 阿里巴巴集团控股有限公司 | Method and equipment for generating session identifier in distributed system |
| CN106407795B (en) * | 2016-09-05 | 2019-05-14 | 北京众享比特科技有限公司 | There are Verification System, authentication method and verification methods for data |
| CN106446067B (en) * | 2016-09-06 | 2020-02-18 | 联动优势科技有限公司 | Method and device for acquiring transaction data |
| CN106357405A (en) * | 2016-09-19 | 2017-01-25 | 弗洛格（武汉）信息科技有限公司 | Method and system for managing data on basis of block chain technology consistency algorithms |
| CN106331151A (en) | 2016-09-19 | 2017-01-11 | 中国银联股份有限公司 | Resource file processing system and method based on block chain structure |
| EP3516545A1 (en) * | 2016-09-21 | 2019-07-31 | R-Stor Inc. | Systems and methods for using a distributed ledger for data handling |
| CN106447311B (en) * | 2016-09-26 | 2019-11-08 | 北京天德科技有限公司 | A kind of block chain of Byzantine failure tolerance algorithms of four communications builds block method |
| CN106528292B (en) * | 2016-10-21 | 2022-04-22 | 上海嘉楠捷思信息技术有限公司 | Task processing method and device |
| CN106547620B (en) * | 2016-10-21 | 2020-05-19 | 杭州嘉楠耘智信息科技有限公司 | Task processing method and device |
| CN106528746B (en) * | 2016-10-26 | 2019-07-16 | 江苏通付盾科技有限公司 | Transaction Information querying method, apparatus and system |
| CN106530083B (en) * | 2016-10-27 | 2018-06-29 | 深圳壹账通智能科技有限公司 | Multichain management method and system based on block chain |
| CN106341421B (en) * | 2016-10-31 | 2019-04-02 | 杭州云象网络技术有限公司 | A kind of method for interchanging data based on block chain technology |
| CN106447309A (en) * | 2016-11-13 | 2017-02-22 | 杭州复杂美科技有限公司 | Across-chain transaction of source chain and lateral chain |
| CN108074629A (en) * | 2016-11-14 | 2018-05-25 | 阿里巴巴集团控股有限公司 | Health file management system and method, subscription client |
| CN106789875B (en) * | 2016-11-15 | 2019-07-02 | 深圳市新国都支付技术有限公司 | A kind of block chain service unit, block chain service system and its communication means |
| CN108090752A (en) * | 2016-11-22 | 2018-05-29 | 深圳银链科技有限公司 | Block chain number franc is supplemented with money, method and device of withdrawing deposit |
| CN106789908B (en) * | 2016-11-23 | 2019-09-06 | 江苏通付盾科技有限公司 | Block common recognition method for building up and system in block chain |
| CN106991334B (en) * | 2016-11-24 | 2021-03-02 | 创新先进技术有限公司 | Data access method, system and device |
| CN106776820A (en) * | 2016-11-25 | 2017-05-31 | 中国银行股份有限公司 | Obtain method and system, block chain, the centralized system of different blocks chain data |
| CN107016542A (en) | 2016-12-06 | 2017-08-04 | 阿里巴巴集团控股有限公司 | A kind of business data processing method, verification method, apparatus and system |
| CN106682907A (en) * | 2016-12-10 | 2017-05-17 | 江苏恒为信息科技有限公司 | Comparison and consensus method for block chain data |
| CN106650496B (en) * | 2016-12-16 | 2020-03-31 | 杭州嘉楠耘智信息科技有限公司 | Data processing method and device |
| US11265147B2 (en) | 2016-12-16 | 2022-03-01 | Nokia Technologies Oy | Secure document management |
| CN106815722B (en) * | 2016-12-22 | 2021-05-07 | 中钞信用卡产业发展有限公司杭州区块链技术研究院 | Information processing method and device based on block chain |
| CN106815530B (en) * | 2016-12-26 | 2020-04-24 | 北京爱接力科技发展有限公司 | Data storage method, data verification method and device |
| CN106651332B (en) * | 2016-12-29 | 2020-11-06 | 成都质数斯达克科技有限公司 | Method for generating new block in block chain and block chain |
| CN106815330B (en) * | 2016-12-29 | 2020-08-21 | 北京瑞卓喜投科技发展有限公司 | Method and system for generating block chain expanded along spatial dimension |
| CN106897351B (en) * | 2016-12-29 | 2020-11-10 | 北京瑞卓喜投科技发展有限公司 | Generation method and system of directed acyclic graph block chain |
| CN107077674B (en) * | 2016-12-29 | 2021-06-11 | 达闼机器人有限公司 | Transaction verification processing method and device and node equipment |
| WO2018126340A1 (en) * | 2017-01-03 | 2018-07-12 | 华为技术有限公司 | Blockchain-based data processing method, device and system |
| CN106682980A (en) * | 2017-01-18 | 2017-05-17 | 北京云知科技有限公司 | Method for designing probability generator |
| CN106886914A (en) * | 2017-01-19 | 2017-06-23 | 北京云知科技有限公司 | It is a kind of to integrate storage method, system and the device for being converted into digital asset |
| CN106850190A (en) * | 2017-02-14 | 2017-06-13 | 北京乐酷达网络科技有限公司 | It is a kind of to the destroying method based on block chain digital certificate |
| CN106789041B (en) * | 2017-02-15 | 2019-07-12 | 江苏信源久安信息科技有限公司 | A kind of credible block chain method of decentralization certificate |
| CN107040582B (en) | 2017-02-17 | 2020-08-14 | 创新先进技术有限公司 | Data processing method and device |
| CN106920167A (en) * | 2017-02-24 | 2017-07-04 | 北京航空航天大学 | A kind of block chain mechanism based on P2P finance and common recognition algorithm |
| CN106920097A (en) * | 2017-02-27 | 2017-07-04 | 钱德君 | A kind of generation time block chain method of Quantum Chain common recognition agreement |
| CN106878000B (en) * | 2017-03-06 | 2020-02-21 | 中钞信用卡产业发展有限公司杭州区块链技术研究院 | Alliance chain consensus method and system |
| CN106952124A (en) * | 2017-03-16 | 2017-07-14 | 北京牛链科技有限公司 | Electronic bill management system and method based on distribution book keeping operation |
| CN108241968B (en) * | 2017-03-26 | 2020-08-14 | 杭州复杂美科技有限公司 | Method for leading processor to participate block chain consensus |
| CN107368507B (en) * | 2017-03-28 | 2020-03-27 | 创新先进技术有限公司 | Block chain-based consensus method and device |
| CN111724150B (en) | 2017-03-28 | 2023-11-24 | 创新先进技术有限公司 | Service request processing method and device |
| CN107066561A (en) * | 2017-03-30 | 2017-08-18 | 中国联合网络通信集团有限公司 | Data managing method and platform |
| US11481360B2 (en) * | 2017-04-07 | 2022-10-25 | Hwa-Shang CHANG | Blockchain network and method of operation thereof |
| EP3610435A1 (en) * | 2017-04-11 | 2020-02-19 | Nchain Holdings Limited | Secure re-use of private key for dynamic group of nodes |
| CN107146087A (en) * | 2017-04-11 | 2017-09-08 | 广东网金控股股份有限公司 | A kind of quick common recognition bookkeeping methods and system based on block chain alliance chain |
| EP3388994A1 (en) * | 2017-04-12 | 2018-10-17 | Siemens Aktiengesellschaft | Method and apparatus for computer-assisted testing of a blockchain |
| GB201706132D0 (en) * | 2017-04-18 | 2017-05-31 | Nchain Holdings Ltd | Computer-implemented system and method |
| CN107122937A (en) * | 2017-04-27 | 2017-09-01 | 电子科技大学 | A kind of freight logistics application process based on block chain |
| CN107124460A (en) * | 2017-04-28 | 2017-09-01 | 北京汇通金财信息科技有限公司 | A kind of alliance's catenary system, the method and apparatus of alliance's chain accounting nodes communication |
| CN107301546B (en) * | 2017-05-03 | 2020-10-16 | 北京众享比特科技有限公司 | Random number generation and application method and device |
| CN108874803B (en) * | 2017-05-09 | 2023-05-12 | 腾讯科技（深圳）有限公司 | Data storage method, device and storage medium |
| WO2018209542A1 (en) * | 2017-05-16 | 2018-11-22 | 北京大学深圳研究生院 | Consensus method for decentralized domain name system |
| CN113904785A (en) * | 2017-05-16 | 2022-01-07 | 江峰 | A multi-center limited-area blockchain authentication system with a sovereign currency release mechanism and a blockchain release mechanism |
| EP4531333A3 (en) * | 2017-05-22 | 2025-06-18 | nChain Licensing AG | Secure provision of undetermined data from an undetermined source into the locking script of a blockchain transaction |
| CN107239954B (en) * | 2017-06-07 | 2021-01-22 | 北京汇通金财信息科技有限公司 | Method and device for increasing block generation speed |
| CN110741400B (en) * | 2017-06-16 | 2025-02-18 | 维萨国际服务协会 | Blockchain network interaction controller |
| CN107194613B (en) * | 2017-06-20 | 2020-12-08 | 无锡井通网络科技有限公司 | Digital asset coding method |
| CN109118214B (en) * | 2017-06-26 | 2020-11-17 | 华为技术有限公司 | Method and device for operating intelligent contract |
| CN109150943B (en) * | 2017-06-27 | 2022-03-29 | 华为技术有限公司 | Information transmission method, device and system |
| CN109214818B (en) * | 2017-06-30 | 2021-06-15 | 华为技术有限公司 | A cross-chain transaction method and device |
| CN107423961B (en) * | 2017-07-11 | 2024-06-14 | 北京泛融科技有限公司 | Optimization consensus method based on random correlation analysis |
| CN107392608B (en) * | 2017-07-11 | 2020-07-07 | 北京博晨技术有限公司 | Block chain system-based digital asset transaction method and block chain system |
| CN107577694B (en) | 2017-07-14 | 2020-04-24 | 创新先进技术有限公司 | Data processing method and device based on block chain |
| CN107424073A (en) * | 2017-07-17 | 2017-12-01 | 杭州复杂美科技有限公司 | A kind of method of across chain numeral credits transaction |
| WO2019018986A1 (en) * | 2017-07-24 | 2019-01-31 | 杭州复杂美科技有限公司 | Method for cross-chain digital creditor right transaction |
| CN107528886B (en) * | 2017-07-25 | 2020-07-31 | 中国科学院计算技术研究所 | Block chain full-network splitting method and system |
| WO2019019056A1 (en) * | 2017-07-26 | 2019-01-31 | 杭州复杂美科技有限公司 | Method for frontal machine to participate in block chain consensus |
| CN107622387B (en) * | 2017-08-04 | 2021-12-10 | 苏州缓流科技有限公司 | Public number payment method based on block chain technology |
| CN107506997B (en) * | 2017-08-04 | 2021-12-10 | 苏州缓流科技有限公司 | Payment method for actively scanning codes on user mobile terminal based on block chain technology |
| CN107480978B (en) * | 2017-08-04 | 2021-12-10 | 苏州缓流科技有限公司 | Payment method based on block chain technology |
| CN107392770A (en) * | 2017-08-09 | 2017-11-24 | 北京云知科技有限公司 | A kind of random-number generating method and system based on block chain |
| CN107633400A (en) * | 2017-08-09 | 2018-01-26 | 北京云知科技有限公司 | A kind of method of payment and device of the machine wallet based on block chain |
| EP3444997A1 (en) * | 2017-08-18 | 2019-02-20 | Siemens Aktiengesellschaft | Devices to provide a quantity of cryptographically protected and filtered as well as sorted transaction datasets of a link of a block chain |
| CN109426952B (en) * | 2017-08-22 | 2021-06-01 | 汇链丰(北京)科技有限公司 | Block chain structure |
| CN107623686B (en) * | 2017-09-12 | 2019-09-17 | 深圳先进技术研究院 | Block chain common recognition reaches method, apparatus |
| CN108009818B (en) * | 2017-10-30 | 2022-02-18 | 国历华融(北京)科技发展有限公司 | Online payment method and system based on distributed network |
| CN107767226A (en) * | 2017-10-30 | 2018-03-06 | 江西博瑞彤芸科技有限公司 | A kind of generation method of pay invoice |
| CN108243241B (en) * | 2017-11-10 | 2019-10-15 | 杭州复杂美科技有限公司 | A kind of storage mode of block chain transaction and queueing form |
| CN107945017B (en) * | 2017-11-16 | 2021-11-12 | 成都赤乌软件技术有限公司 | Hybrid chain accounting method based on multi-stage verification |
| CN108197944B (en) * | 2017-11-22 | 2021-03-30 | 远光软件股份有限公司 | Resource transaction method and device based on block chain technology |
| CN107995270A (en) * | 2017-11-24 | 2018-05-04 | 成都赤乌软件技术有限公司 | A kind of method that distributed document storage is realized based on block chain |
| CN109842655A (en) * | 2017-11-28 | 2019-06-04 | 北京众享比特科技有限公司 | A kind of method of data synchronization of transregional piece of chain network |
| WO2019111506A1 (en) * | 2017-12-04 | 2019-06-13 | ソニー株式会社 | Information processing device, information processing method, and program |
| CN109905286B (en) * | 2017-12-11 | 2021-10-12 | 北京京东乾石科技有限公司 | Method and system for monitoring running state of equipment |
| CN108241979B (en) * | 2017-12-20 | 2021-03-16 | 深圳壹账通智能科技有限公司 | Multi-account book transfer method based on block chain, electronic device and readable storage medium |
| CN109961286A (en) * | 2017-12-26 | 2019-07-02 | 库币科技有限公司 | Digital asset method of commerce |
| CN108334553B (en) * | 2017-12-29 | 2020-07-10 | 北京欧链科技有限公司 | Data screening method and device based on block chain |
| CN108390762B (en) * | 2017-12-29 | 2020-07-14 | 北京欧链科技有限公司 | Data screening method and device based on block chain |
| CN108288156B (en) * | 2018-01-04 | 2020-08-14 | 杭州复杂美科技有限公司 | Block chain transaction storage and queuing method |
| CN108259235B (en) * | 2018-01-04 | 2019-11-22 | 杭州复杂美科技有限公司 | A kind of block chain accounting nodes selection method |
| CN108269190A (en) * | 2018-01-17 | 2018-07-10 | 深圳四方精创资讯股份有限公司 | Across chain method and its system based on across chain relaying platform |
| CN108347486A (en) * | 2018-02-12 | 2018-07-31 | 众安信息技术服务有限公司 | Across chain communication means, device and system based on block chain |
| CN108600161A (en) * | 2018-03-12 | 2018-09-28 | 成都零光量子科技有限公司 | A kind of fair efficient block chain common recognition method |
| CN110276609B (en) * | 2018-03-14 | 2022-02-22 | 北京三快在线科技有限公司 | Business data processing method and device, electronic equipment and computer readable medium |
| CN108446376B (en) * | 2018-03-16 | 2022-04-08 | 众安信息技术服务有限公司 | Data storage method and device |
| CN108615148B (en) * | 2018-03-26 | 2019-03-15 | 北交金科金融信息服务有限公司 | A kind of preposition method of commerce of secured assets and system based on block chain technology |
| US11146545B2 (en) * | 2018-03-27 | 2021-10-12 | Exosite LLC | Apparatus and method for establishing secured connection |
| CN108512861A (en) * | 2018-04-18 | 2018-09-07 | 北京百悟科技有限公司 | A kind of authentication method and device, computer readable storage medium of cloud platform |
| CN112600841B (en) * | 2018-04-19 | 2023-09-19 | 创新先进技术有限公司 | Credit record sharing method and device based on block chain and electronic equipment |
| CN108922585A (en) * | 2018-04-27 | 2018-11-30 | 长春市万易科技有限公司 | A kind of intelligent health bracelet date storage method and system based on block chain |
| CN110427391B (en) * | 2018-04-28 | 2023-07-28 | 伊姆西Ip控股有限责任公司 | Method, apparatus and computer program product for determining duplicate data |
| CN108616596B (en) * | 2018-05-09 | 2020-12-25 | 南京邮电大学 | Block chain self-adaptive consensus method based on dynamic authorization and network environment perception |
| CN108769144A (en) * | 2018-05-11 | 2018-11-06 | 中国联合网络通信集团有限公司 | Storage processing method, transaction node, memory node and communication equipment |
| CN108694581B (en) * | 2018-05-11 | 2021-06-29 | 中国联合网络通信集团有限公司 | Transaction information processing method, device and blockchain node |
| CN110569395B (en) * | 2018-05-18 | 2024-07-23 | 北京天德科技有限公司 | Stable and reliable block chain Bayesian-busy consensus flow design method |
| CN108897760A (en) * | 2018-05-22 | 2018-11-27 | 贵阳信息技术研究院（中科院软件所贵阳分部） | Electronic evidence chain integrity verification method based on Merkel tree |
| CN108712250B (en) * | 2018-05-24 | 2023-04-07 | 深圳前海益链网络科技有限公司 | Block chain Token release centralized control method based on digital signature |
| CN108764909A (en) * | 2018-06-01 | 2018-11-06 | 杭州复杂美科技有限公司 | A kind of block chain data monitoring and managing method |
| CN108764872B (en) * | 2018-06-01 | 2020-07-10 | 杭州复杂美科技有限公司 | Authorized payment method, system, equipment and storage medium |
| CN108876369B (en) * | 2018-06-05 | 2021-07-13 | 上海和数软件有限公司 | Block chain-based data communication method and device and computer-readable storage medium |
| CN108876616A (en) * | 2018-06-13 | 2018-11-23 | 众安信息技术服务有限公司 | Exchange information processing method, device and assets based on block chain register settlement system |
| CN109033788B (en) * | 2018-06-15 | 2021-06-11 | 北京文创园投资管理有限公司 | Certificate management method and device based on block chain technology |
| CN108846642A (en) * | 2018-06-21 | 2018-11-20 | 夸克链科技（深圳）有限公司 | A kind of block chain community autonomy system |
| DE102018210224A1 (en) * | 2018-06-22 | 2019-12-24 | Robert Bosch Gmbh | Method and device for agreeing a cooperation between a first system and a second system |
| CN109035016B (en) * | 2018-06-28 | 2020-10-23 | 杭州复杂美科技有限公司 | Multi-chain concurrent transaction method |
| CN108984662B (en) * | 2018-06-28 | 2021-02-09 | 杭州复杂美科技有限公司 | Block chain data synchronization method |
| CN108921556B (en) * | 2018-07-02 | 2022-04-19 | 上海达家迎信息科技有限公司 | Block chain verification method, device, equipment and storage medium |
| CN109120669B (en) * | 2018-07-03 | 2021-06-04 | 泰链（厦门）科技有限公司 | Method, medium, and system for building block chain based on P2P internet |
| CN109087079B (en) * | 2018-07-09 | 2021-03-30 | 北京知帆科技有限公司 | Digital currency transaction information analysis method |
| CN108876378B (en) * | 2018-07-11 | 2022-04-19 | 北京国泰网信科技有限公司 | Public link data encryption backup method |
| CN109064169B (en) * | 2018-07-13 | 2020-11-06 | 杭州复杂美科技有限公司 | Transaction method, apparatus and storage medium |
| CN109245894B (en) * | 2018-07-18 | 2021-03-26 | 电子科技大学 | Distributed cloud storage system based on intelligent contracts |
| CN108985742B (en) * | 2018-07-19 | 2022-04-05 | 深圳市迅雷网络技术有限公司 | Transaction processing method, device and blockchain system |
| CN109064171A (en) * | 2018-07-26 | 2018-12-21 | 杭州秘猿科技有限公司 | A kind of method, apparatus and electronic system of block chain parallel transaction |
| CN109087098A (en) * | 2018-07-27 | 2018-12-25 | 杭州复杂美科技有限公司 | A kind of transaction processing method, system, equipment and storage medium for permitting chain |
| CN109063097B (en) * | 2018-07-27 | 2020-06-23 | 广州天高软件科技有限公司 | Data comparison and consensus method based on block chain |
| CN109087204B (en) * | 2018-07-27 | 2023-04-14 | 杭州复杂美科技有限公司 | Cross-chain transaction verification method, device and storage medium |
| CN109032803B (en) | 2018-08-01 | 2021-02-12 | 创新先进技术有限公司 | Data processing method and device and client |
| CN109242484A (en) * | 2018-08-09 | 2019-01-18 | 玄章技术有限公司 | A kind of common recognition motivational techniques of block chain |
| CN109309707B (en) * | 2018-08-15 | 2021-06-04 | 泰链（厦门）科技有限公司 | Method and medium for transferring information between different blockchain systems |
| CN108985100B (en) * | 2018-08-15 | 2022-02-25 | 百度在线网络技术（北京）有限公司 | Block chain-based element security certification method, device, equipment and medium |
| CN109005186B (en) * | 2018-08-20 | 2020-12-11 | 杭州复杂美科技有限公司 | Method, system, equipment and storage medium for isolating user identity information |
| WO2020037579A1 (en) * | 2018-08-22 | 2020-02-27 | 区链通网络有限公司 | Block chain system-based human-machine recognition method and apparatus, and storage medium |
| CN109087105A (en) * | 2018-08-31 | 2018-12-25 | 深圳付贝科技有限公司 | For digging the Hash Search method of mine, digging mine machine and block catenary system |
| CN109299335A (en) * | 2018-08-31 | 2019-02-01 | 阿里巴巴集团控股有限公司 | Control method, device, server and the readable storage medium storing program for executing of data storage |
| CN109087111A (en) * | 2018-08-31 | 2018-12-25 | 深圳付贝科技有限公司 | Common recognition verification method, digging mine machine and block catenary system based on block chain |
| CN109257342B (en) | 2018-09-04 | 2020-05-26 | 阿里巴巴集团控股有限公司 | Block chain cross-chain authentication method, system, server and readable storage medium |
| CN110880968A (en) * | 2018-09-05 | 2020-03-13 | 元一科技控股有限公司 | Block transmission and recording method and device and computer storage medium |
| CN109271799A (en) * | 2018-09-17 | 2019-01-25 | 深圳市天达国际商业咨询有限公司 | A kind of medical monitoring platform based on block chain and Internet of Things |
| CN110941859B (en) * | 2018-09-21 | 2025-03-07 | 上海派链信息科技有限公司 | Method, device, computer-readable storage medium, and computer program product for forming consensus on blockchain |
| CN109361588B (en) * | 2018-09-29 | 2021-04-30 | 湖南智慧政务区块链科技有限公司 | Block chain network construction method and system based on star network |
| CN109472593A (en) * | 2018-10-10 | 2019-03-15 | 远光软件股份有限公司 | A kind of settlement method based on block chain technology, device and block chain network |
| CN111047439B (en) * | 2018-10-12 | 2024-05-14 | 北京邦天信息技术有限公司 | Transaction processing method based on blockchain |
| CN109460530A (en) * | 2018-10-18 | 2019-03-12 | 尚维斯 | A kind of block chain chain address register method |
| CN109391619B (en) * | 2018-10-22 | 2021-08-03 | 上海幼鸢网络科技有限公司 | Cross-link certificate exchange method based on authority and computer readable medium |
| CN109460996B (en) * | 2018-10-26 | 2020-08-28 | 全链通有限公司 | Public block chain processing method, device and computer readable storage medium |
| CN109409749A (en) * | 2018-10-30 | 2019-03-01 | 四川长虹电器股份有限公司 | A kind of IT assets management method based on block chain |
| CN109598506B (en) * | 2018-11-02 | 2023-06-09 | 克洛斯比尔有限公司 | Method, system, computing device and computer readable storage medium for precisely delaying encryption of blockchain |
| CN109409136A (en) * | 2018-11-08 | 2019-03-01 | 中链科技有限公司 | Block chain deposits the verification method, device and calculating equipment of card content |
| CN109698750B (en) * | 2018-11-08 | 2021-06-11 | 平安科技（深圳）有限公司 | Block generation method, device and equipment of block chain and readable storage medium |
| CN109218981B (en) * | 2018-11-20 | 2019-06-21 | 太原理工大学 | Wi-Fi access authentication method based on location signal feature consensus |
| CN110020945B (en) | 2018-11-27 | 2020-10-30 | 创新先进技术有限公司 | Data reading method and system based on multiple block chain networks |
| CN110060152B (en) * | 2018-11-27 | 2020-10-30 | 创新先进技术有限公司 | Data reading method and system based on multiple block chain networks |
| CN110060153B (en) * | 2018-11-27 | 2020-11-17 | 创新先进技术有限公司 | Data evidence storage method and system based on multiple block chain networks |
| CN109583903B (en) * | 2018-11-28 | 2020-12-11 | 杭州复杂美科技有限公司 | Block confirmation method, equipment and storage medium |
| CN109684878B (en) * | 2018-12-17 | 2021-01-26 | 杭州安恒信息技术股份有限公司 | A method and system for preventing tampering of privacy information based on blockchain technology |
| CN109685664B (en) * | 2018-12-20 | 2021-08-13 | 姚前 | Digital asset real-name registration system based on asset hosting system association |
| CN109687953B (en) * | 2018-12-24 | 2021-12-31 | 杭州复杂美科技有限公司 | Transaction classification method, apparatus and storage medium |
| CN110049087B (en) * | 2018-12-28 | 2020-05-05 | 阿里巴巴集团控股有限公司 | Credibility verification method, system, device and equipment of alliance chain |
| CN110011785B (en) * | 2018-12-28 | 2021-05-18 | 创新先进技术有限公司 | Method and device for storing certificate of structured work based on block chain |
| CN109710626B (en) * | 2018-12-29 | 2021-08-24 | 北京金山安全软件有限公司 | Data warehousing management method and device, electronic equipment and storage medium |
| CN111443998B (en) * | 2019-01-17 | 2023-03-21 | 杨税令 | Multi-layer segment type consensus method and system applied to block chain |
| CN109785170B (en) * | 2019-01-21 | 2021-01-29 | 中国联合网络通信集团有限公司 | Block chain-based insurance application method and block chain-based insurance application system |
| CN111489256B (en) * | 2019-01-25 | 2023-06-23 | 京东科技控股股份有限公司 | Cross-chain processing method, device and system for multi-chain block chain system |
| WO2020155167A1 (en) * | 2019-02-02 | 2020-08-06 | Microsoft Technology Licensing, Llc | Application of cross-organizational transactions to blockchain |
| CN109831514B (en) * | 2019-03-02 | 2020-06-09 | 杭州复杂美科技有限公司 | Parallel chain consensus method, data exception handling method, device and storage medium |
| CN110109920B (en) * | 2019-03-19 | 2022-03-22 | 咪咕文化科技有限公司 | Data comparison method and server |
| CN109995775B (en) * | 2019-03-22 | 2021-06-01 | 杭州复杂美科技有限公司 | Block chain verification code application method, equipment and storage medium |
| CN110175840B (en) * | 2019-04-19 | 2021-08-03 | 华中科技大学 | Method, client, alliance chain and system for realizing light wallet mechanism in alliance chain |
| CN110070443B (en) * | 2019-04-23 | 2023-07-11 | 深圳前海微众银行股份有限公司 | A blockchain-based bill processing method and device |
| US11294875B2 (en) | 2019-05-31 | 2022-04-05 | Advanced New Technologies Co., Ltd. | Data storage on tree nodes |
| CN110275884B (en) * | 2019-05-31 | 2020-08-04 | 阿里巴巴集团控股有限公司 | Data storage method and node |
| CN110245190B (en) * | 2019-06-11 | 2021-11-02 | 南京荣链科技有限公司 | Block data segmented storage method, terminal and medium |
| CN110222095B (en) * | 2019-06-18 | 2021-06-22 | 北京瑞策科技有限公司 | E-commerce data query method applied to block chain and user equipment |
| US10742415B2 (en) | 2019-06-28 | 2020-08-11 | Alibaba Group Holding Limited | Method and apparatus for inter-blockchain transmission of authenticable message |
| CN110443076B (en) * | 2019-08-07 | 2021-06-01 | 瑞资(北京)科技有限公司 | Evidence storage method and system based on real-name block chain |
| CN110505067B (en) * | 2019-09-11 | 2021-01-05 | 北京邮电大学 | Block chain processing method, device, equipment and readable storage medium |
| CN110559663B (en) * | 2019-09-11 | 2022-06-10 | 腾讯科技（深圳）有限公司 | Display control method and device for virtual rounds in game |
| CN110738569A (en) * | 2019-09-28 | 2020-01-31 | 北京瑞卓喜投科技发展有限公司 | Transaction certificate processing method, device and system based on block chain |
| CN110751556A (en) * | 2019-09-28 | 2020-02-04 | 北京瑞卓喜投科技发展有限公司 | Asset issuing supervision method, equipment and system |
| CN110602252B (en) * | 2019-09-30 | 2021-06-15 | 东南大学 | A blockchain-enhanced open IoT access architecture |
| CN111222158B (en) * | 2019-11-07 | 2022-07-12 | 杭州趣链科技有限公司 | Block chain-based two-party security and privacy comparison method |
| CN110880147B (en) * | 2019-11-22 | 2022-08-26 | 腾讯科技（深圳）有限公司 | Transaction processing method, related equipment and computer storage medium |
| CN110933162B (en) * | 2019-11-27 | 2022-03-25 | 山东九州信泰信息科技股份有限公司 | Block chain virtual subnet subsection storage method |
| CN111131171B (en) * | 2019-12-03 | 2021-05-11 | 深圳前海微众银行股份有限公司 | A method and device for node authentication based on blockchain network |
| CN111242618B (en) * | 2020-01-08 | 2023-05-30 | 成都库珀创新科技有限公司 | Private key keeping method and device based on blockchain contract technology |
| CN111242625B (en) * | 2020-02-26 | 2023-06-20 | 恬家（上海）信息科技有限公司 | Skin block, skin chain network and realization method thereof |
| CN113408003B (en) * | 2020-03-16 | 2022-11-04 | 上海唯链信息科技有限公司 | Block chain cross-chain method and device |
| CN111428277B (en) * | 2020-03-20 | 2023-08-18 | 中国建设银行股份有限公司 | Block chain data verification method, device and system |
| CN111478890B (en) * | 2020-03-30 | 2021-12-03 | 中国科学院计算技术研究所 | Network service access control method and system based on intelligent contract |
| CN113919289B (en) * | 2020-07-08 | 2025-03-18 | 上海宽带技术及应用工程研究中心 | Bitcoin wallet address string encoding method and address number table generation method |
| CN111737766B (en) * | 2020-08-03 | 2020-12-04 | 南京金宁汇科技有限公司 | Method for judging validity of digital certificate signature data in block chain |
| CN111814083B (en) * | 2020-08-31 | 2020-12-11 | 腾讯科技（深圳）有限公司 | Display result generation method, system, device, readable storage medium and equipment |
| CN112131235A (en) * | 2020-09-21 | 2020-12-25 | 中国电子科技网络信息安全有限公司 | Method for realizing transaction credibility verification in block chain system |
| CN112163917B (en) * | 2020-09-28 | 2024-06-07 | 财付通支付科技有限公司 | Bill processing method and device based on blockchain, medium and electronic equipment |
| CN112733174B (en) * | 2020-10-29 | 2022-07-19 | 腾讯科技（深圳）有限公司 | Authentication management method and system of block chain system and electronic equipment |
| CN112600905B (en) * | 2020-12-09 | 2023-04-14 | 杭州复杂美科技有限公司 | Transaction broadcasting and block generating method, apparatus and storage medium |
| CN112597545B (en) * | 2020-12-28 | 2024-04-12 | 山西云时代研发创新中心有限公司 | Medical electronic contract evidence-preserving method based on blockchain technology |
| CN112712366B (en) * | 2021-01-11 | 2024-12-27 | 卓密密 | Block execution method, computer device and storage medium |
| CN112800055A (en) * | 2021-01-18 | 2021-05-14 | 湖北宸威玺链信息技术有限公司 | Data truth verification method, system, device and medium based on bloom filter |
| CN115114303A (en) * | 2021-03-22 | 2022-09-27 | 中国移动通信集团江苏有限公司 | Service data auditing method, platform and system |
| CN112714192B (en) * | 2021-03-25 | 2021-07-02 | 腾讯科技（深圳）有限公司 | Data synchronization method and device, computer readable medium and electronic equipment |
| TWI770933B (en) * | 2021-04-09 | 2022-07-11 | 重量科技股份有限公司 | Identity recognition management method and identity recognition management system based on cross-chain architecture |
| CN115619395A (en) * | 2021-07-15 | 2023-01-17 | 腾讯科技（深圳）有限公司 | Blockchain-based data processing method and related equipment |
| CN113657893B (en) * | 2021-08-16 | 2023-05-23 | 四川长虹网络科技有限责任公司 | Digital wallet payment encryption and decryption method and digital wallet |
| CN113409047B (en) * | 2021-08-18 | 2021-11-23 | 腾讯科技（深圳）有限公司 | Data processing method, device and equipment based on block chain and readable storage medium |
| CN113743944B (en) * | 2021-11-04 | 2022-03-29 | 中国信息通信研究院 | Cross-chain message reliable transmission method and device and electronic equipment |
| CN116187988A (en) * | 2021-11-26 | 2023-05-30 | 中国人民银行数字货币研究所 | Offline transaction method and device based on digital currency |
| CN114553887B (en) * | 2022-01-24 | 2024-04-05 | 浙江数秦科技有限公司 | A blockchain network point-to-point data transmission method |
| CN115052047B (en) * | 2022-01-27 | 2024-08-09 | 昆明理工大学 | A pre-verification method for Gossip network protocol |
| CN115297009B (en) * | 2022-07-08 | 2023-11-17 | 中电信数智科技有限公司 | Digital encryption consistency optimization method based on blockchain distributed network |
| CN116204581B (en) * | 2022-12-02 | 2024-11-08 | 北京火山引擎科技有限公司 | Data writing method and device, computer equipment and storage medium |
| CN118297611B (en) * | 2024-06-04 | 2024-08-20 | 凉山彝族自治州农业科学研究院 | Block chain-based fresh and sweet fragrance raw material tracing method and system |
| CN118608077B (en) * | 2024-06-07 | 2024-11-19 | 江苏富深协通科技股份有限公司 | Provident Fund Data Quality Assessment and Grading Early Warning System and Method |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104320262A (en) * | 2014-11-05 | 2015-01-28 | 中国科学院合肥物质科学研究院 | User public key address binding, searching and verifying method and system based on crypto currency open account book technology |
| CN104915249A (en) * | 2015-05-21 | 2015-09-16 | 北京比特大陆科技有限公司 | Method and device for digging virtual digital coins in mining pool |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9020946B2 (en) * | 2010-07-12 | 2015-04-28 | Qvinci Software, Llc | System and method for compilation of quickbooks accounts data |
-
2016
- 2016-01-22 CN CN201610040598.6A patent/CN105719185B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104320262A (en) * | 2014-11-05 | 2015-01-28 | 中国科学院合肥物质科学研究院 | User public key address binding, searching and verifying method and system based on crypto currency open account book technology |
| CN104915249A (en) * | 2015-05-21 | 2015-09-16 | 北京比特大陆科技有限公司 | Method and device for digging virtual digital coins in mining pool |
Non-Patent Citations (1)
| Title |
|---|
| Bitcoin: A Peer-to-Peer Electronic Cash System;Satoshi Nakamoto;《Consulted,2008,https://bitcoin.org/bitcoin.pdf》;20081231;1-9 |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106886890A (en) * | 2017-02-07 | 2017-06-23 | 杭州秘猿科技有限公司 | A kind of timing transaction execution method based on block chain |
| TWI728692B (en) | 2019-06-28 | 2021-05-21 | 開曼群島商創新先進技術有限公司 | Method and device for sending certifiable messages across chains |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105719185A (en) | 2016-06-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105719185B (en) | The data comparison and common recognition method of block chain | |
| CN106682907A (en) | Comparison and consensus method for block chain data | |
| Bilal et al. | Blockchain technology: Opportunities & challenges | |
| Kaur et al. | Scalability in blockchain: Challenges and solutions | |
| US20230410215A1 (en) | Cryptographic method and system for secure extraction of data from a blockchain | |
| US20220292471A1 (en) | Universal tokenisation system for blockchain-based cryptocurrencies | |
| Zhou et al. | Solutions to scalability of blockchain: A survey | |
| US20230119636A1 (en) | Blockchain methods, nodes, systems and products | |
| US20200211011A1 (en) | Scalable Distributed Ledger System | |
| CN109325747B (en) | Remittance method and device based on block chain | |
| CN107533700A (en) | Verify electronic transactions | |
| US20190164150A1 (en) | Using Blockchain Ledger for Selectively Allocating Transactions to User Accounts | |
| CN110473106A (en) | A kind of method and relevant apparatus of trading processing | |
| AU2022204696A1 (en) | Scalable distributed ledger system, transaction privacy and combating fraud, theft and loss | |
| KR20200073803A (en) | Block Chain Electronic Wallet Management System | |
| Gjermundrød et al. | Going beyond the coinbase transaction fee: Alternative reward schemes for miners in blockchain systems | |
| CN112801778A (en) | Federated bad asset blockchain | |
| CN112529660B (en) | Blockchain-based electronic ticketing method and system, electronic device and storage medium | |
| CN119151539B (en) | A multi-level hardware wallet transaction method, medium and system for digital currency | |
| CN113935836A (en) | Cross-border payment method, system, equipment and medium based on Fabric alliance chain | |
| KR20200046995A (en) | System and method for constructing book-sharing economic platform based on block chain | |
| CN115375316A (en) | Offline payment method, device and storage medium | |
| WO2024007527A1 (en) | Transaction security for multi-tier transaction networks | |
| Panchal et al. | Decentralized Car Hailing Application | |
| HK40046508A (en) | Cryptographic method and system for secure extraction of data from a blockchain |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: 310012 Building 6, East Software Park, No. 90 Wensan Road, Xihu District, Hangzhou City, Zhejiang Province Applicant after: HANGZHOU FUZAMEI TECHNOLOGY Co.,Ltd. Address before: Room 409, Huaxing Pioneering Building, 58 College Road, Hangzhou City, Zhejiang Province, 310012 Applicant before: HANGZHOU FUZAMEI TECHNOLOGY Co.,Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |