Comparison and consensus method for block chain data

A data comparison and blockchain technology, applied in the field of Internet data transmission, can solve the problems of indeterminate source of data download, inflexible data storage, high probability of repeated transaction data transmission, etc.

Inactive Publication Date: 2017-05-17
江苏恒为信息科技有限公司
View PDF3 Cites 85 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] 1. When comparing new block transaction data, all hash values ​​need to be transmitted, and the amount of data is large;
[0004] 2. The probability of duplication of transaction data transmission is high, and the lack of data cannot be determined to find the source of download. The efficiency is not high, the data is not easy to complete, and some tran

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Comparison and consensus method for block chain data
  • Comparison and consensus method for block chain data
  • Comparison and consensus method for block chain data

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0051] Embodiment 1, with reference to figure 1 :

[0052] This embodiment illustrates how to use non-repeating numbers to look up missing data.

[0053] Using non-repeating numbers to compare missing data, the number of transactions in the new block is estimated to be 6, and the total number is set to the 4th power of 2, represented by the first two digits of the transaction hash value.

[0054] There are a total of 16 numbers (0 to 15) to choose from. Create a 16-digit string StringA16 with all "0". After the front node A server selects a non-repeating number, match the number with the string position one by one. Get up, replace the 0 string in the corresponding position with 1, and the 16-bit string position numbers are 0 to 15 from left to right. Here, the characters at the 0, 4, 7, a, d, and f positions of the string are "1".

[0055] Server B also creates a 16-bit string StringB16 with all 0s like server A. After receiving the transaction data from server A, the serve...

Embodiment 2

[0059] Embodiment 2, with reference to attached figure 2 :

[0060] This example illustrates how to generate non-repeating numbers.

[0061] Assume that the number 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, a, b, c, d, e, f (hexadecimal) number is assigned to the front cloud node to get the number for the user.

[0062] In addition to the fact that the first digit must be 2, the No. 2 node also stipulates that the second and third digits cannot be repeated, that is, 16*16=256, that is, it is stipulated that this node can only send up to 256 different numbers in each block. transaction number.

[0063] The user can stipulate that the several transactions sent are the fourth transactions of the wallet. The system stipulates that only one transaction will take effect each time, so there is no need to worry about overpayment.

[0064] If the user chooses node 2 to send transactions, a batch of transaction hash values ​​will be generated, and several transactions whose first digit is 2 will...

Embodiment 3

[0067] Embodiment 3, with reference to image 3 :

[0068] This embodiment illustrates the use of Bloom filter to check the omission of data. The hash value generated within a period of time by changing the random number can make it not repeated in the Bloom filter, and the data can be transmitted from server A to server B. The misjudgment rate of the post-post comparison is reduced to 0 (assuming that the data will only be missed and no new data will appear).

[0069] Step S1: Here, a total of 6 hash values ​​are to be transmitted from server A to server B, and the number of Bloom filter groups is set to 16 bits.

[0070] Step S2: Change the hash value generated by the random number so that it will not be repeated in the Bloom filter on the A server, and each time the hash value is added to the Bloom filter, there is at least one in the binary bit array Position 1 is uniquely corresponding to the added hash value, and the six hash values ​​of h1, h2, h3, h4, h5, and h6 corr...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a comparison and consensus method for block chain data. The comparison and consensus method includes computing hash values of contents of each transaction, transforming random numbers to prevent N-digit numbers in preset hash values from being repetitive in a period of time; comparing non-repetitive serial numbers of the different hash values with one another among accounting servers to judge whether the transactions are consistent with one another or not. The N-digit numbers are called as the non-repetitive serial numbers, and the N is a positive integer. The comparison and consensus method has the advantages that the non-repetitive serial numbers can be compared with one another by means of establishing similar Merkel tree modes, appointed digits of the hash values of the transactions are free of repetition and can be used as the serial numbers, the serial numbers can be arranged in similar Merkel trees according to certain rules, the arrangement locations of the hash values of the same transaction in the corresponding Merkel trees are completely consistent with one another on the different accounting servers, accordingly, difference can be quickly found out, data transmission can be reduced, and required consensus time can be shortened to a great extent.

Description

technical field [0001] The invention relates to the field of Internet data transmission, in particular to data comparison and consensus in block chain verification technology. Background technique [0002] As the network becomes more and more important in people's daily life, the security and anti-counterfeiting requirements of important information on the network are also very urgent. As a verification and anti-counterfeiting technology developed with Bitcoin, blockchain technology has been widely used, but there are still some problems as follows: [0003] 1. When comparing new block transaction data, all hash values ​​need to be transmitted, and the amount of data is large; [0004] 2. The probability of duplication of transaction data transmission is high, and the lack of data cannot be determined to find the source of download. The efficiency is not high, the data is not easy to complete, and some transactions have a long delay; [0005] 3. Or choose a server to packa...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06Q20/40
CPCG06Q20/401G06Q20/4016
Inventor 崔春生徐钰淳胡坤陈东雷朱磊钱云超
Owner 江苏恒为信息科技有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap