CN110535658A - Block chain data processing method, apparatus and system - Google Patents
Block chain data processing method, apparatus and system Download PDFInfo
- Publication number
- CN110535658A CN110535658A CN201910824665.7A CN201910824665A CN110535658A CN 110535658 A CN110535658 A CN 110535658A CN 201910824665 A CN201910824665 A CN 201910824665A CN 110535658 A CN110535658 A CN 110535658A
- Authority
- CN
- China
- Prior art keywords
- random number
- parallel
- data
- interval
- position random
- 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.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
- H04L9/3239—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
- H04L2209/12—Details relating to cryptographic hardware or logic circuitry
- H04L2209/125—Parallelization or pipelining, e.g. for accelerating processing of cryptographic operations
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Advance Control (AREA)
Abstract
This disclosure relates to a kind of block chain data processing method, apparatus and system, which comprises identical input data is inputted multiple parallel branch parallel;The multiple parallel branch is based on the input data and carries out parallel processing to block head data, during carrying out parallel processing to block head data, the multiple parallel branch is directed to the random number field of the block head data, carries out the cumulative iteration of the initial position random number nonce_sta to final position random number nonce_fin of multiple and different Parallel Intervals parallel.The embodiment provided using each embodiment of the disclosure can reduce cycle calculations time-consuming, improve data-handling efficiency.
Description
Technical field
This disclosure relates to computer data processing technology field more particularly to a kind of block chain data processing method, device
And system.
Background technique
Block chain digs the process of mine, is exactly by the iterative random number nonce that adds up, the sha256 for calculating block head is dual
Data summarization digs mine success if this abstract is less than target value.
In the prior art, as shown in figure 4, being by first time Hash calculation STAGE_1 and second of Hash calculation
STAGE_2 is to input data the second field 512bit, according to the cumulative traversal for doing sha256 algorithm of nonce.But due to
The data bit width of machine number Nonce is 32bit, and the cumulative range of maximum is 0~2^32, and traversal is double hash iteration every time
It recycles 128 times and obtains output data, this causes calculating data volume huge, and calculating takes a long time.
Summary of the invention
The present disclosure proposes a kind of block chain data processing methods, apparatus and system to be improved with reducing cycle calculations time-consuming
Data-handling efficiency.
According to the disclosure in a first aspect, providing a kind of block chain data processing method, which comprises
Identical input data is inputted into multiple parallel branch parallel;
The multiple parallel branch is based on the input data and carries out parallel processing to block head data, to block head number
During carrying out parallel processing, the multiple parallel branch is directed to the random number field of the block head data, and advances
The cumulative of the initial position random number nonce_sta to final position random number nonce_fin of the multiple and different Parallel Intervals of row changes
Generation.
In one possible implementation, the initial position random number for carrying out multiple and different Parallel Intervals parallel
Cumulative iteration of the nonce_sta to final position random number nonce_fin, comprising:
By the initial position random number nonce_sta of the multiple Parallel Interval, the multiple parallel branch is inputted respectively,
Wherein each Parallel Interval includes respective initial position random number nonce_sta and final position random number nonce_fin;
Using the multiple parallel branch by the initial position random number nonce_sta of multiple Parallel Intervals, add up
Iteration is to final position random number nonce_fin.
In one possible implementation, the method also includes:
According to initial initial position random number and initial final position random number, the whole data field for needing iteration is determined
Between;
The data interval is divided into the multiple Parallel Interval.
In one possible implementation, the data interval is divided into the multiple Parallel Interval includes:
According to the degree of parallelism of the parallel branch, the data interval is divided into the multiple Parallel Interval.
In one possible implementation, the input data includes Hash initial value and Hash constant.
According to the second aspect of the disclosure, a kind of block chain data processing equipment is provided, described device includes:
Input unit, for identical input data to be inputted multiple parallel branch parallel;
Parallel processing element is configured as the multiple parallel branch and is based on the input data to the progress of block head data
Parallel processing, during carrying out parallel processing to block head data, the multiple parallel branch is directed to the block head number
According to random number field, carry out parallel the initial position random number nonce_sta of multiple and different Parallel Intervals to final position with
The cumulative iteration of machine number nonce_fin.
In one possible implementation, the parallel processing element, is configured to:
By the initial position random number nonce_sta of the multiple Parallel Interval, the multiple parallel branch is inputted respectively,
Wherein each Parallel Interval includes respective initial position random number nonce_sta and final position random number nonce_fin;
Using the multiple parallel branch by the initial position random number nonce_sta of multiple Parallel Intervals, add up
Iteration is to final position random number nonce_fin.
In one possible implementation, described device further include:
Control unit is configured as being determined whole according to initial initial position random number and initial final position random number
Need the data interval of iteration;
The data interval is divided into the multiple Parallel Interval.
In one possible implementation, the data interval is divided into the multiple Parallel Interval includes:
According to the degree of parallelism of the parallel branch, the data interval is divided into the multiple Parallel Interval.
In one possible implementation, the input data includes Hash initial value and Hash constant.
In one possible implementation, described device further include:
Data storage cell, for storing the metadata digest information of hit;
Interface unit is used for reading and writing data and parameter configuration.
According to the third aspect of the disclosure, block chain data processing system is provided, the system comprises at least one
Device and the memory for storage processor executable instruction are managed, the processor realizes above-mentioned side when executing described instruction
Method.
According to another aspect of the present disclosure, a kind of non-volatile computer readable storage medium storing program for executing is provided, is stored thereon with
Computer program instructions, wherein the computer program instructions realize the above method when being executed by processor.
, can be by the multiple identical input datas of parallel processing according to the embodiment of all aspects of this disclosure, while benefit
With the cumulative iterative calculation of the random number nonce in multiple parallel branch parallel processing difference sections, random number can be effectively reduced
The time-consuming of nonce iterative calculation, to effectively improve data-handling efficiency.
According to below with reference to the accompanying drawings to detailed description of illustrative embodiments, the other feature and aspect of the disclosure will become
It is clear.
Detailed description of the invention
Comprising in the description and constituting the attached drawing of part of specification and specification together illustrates the disclosure
Exemplary embodiment, feature and aspect, and for explaining the principles of this disclosure.
Fig. 1 shows a kind of flow diagram for block chain data processing method that a kind of embodiment of the disclosure provides.
Fig. 2 shows a kind of modular structure schematic diagrams for block chain data processing equipment that a kind of embodiment of the disclosure provides.
Fig. 3 shows the allocation flow schematic diagram for the parallel processing that a kind of embodiment of the disclosure provides.
Fig. 4 shows the flow diagram that a kind of block chain in the prior art digs mine.
Fig. 5 shows a kind of algorithm flow schematic diagram for sha256 algorithm that a kind of embodiment of the disclosure provides.
Fig. 6 shows a kind of structural schematic diagram for block chain data processing system that a kind of embodiment of the disclosure provides.
Fig. 7 is shown according to an exemplary embodiment a kind of for executing the block diagram of the device 800 of the above method.
Fig. 8 is shown according to an exemplary embodiment a kind of for executing the block diagram of the device 1900 of the above method.
Specific embodiment
Various exemplary embodiments, feature and the aspect of the disclosure are described in detail below with reference to attached drawing.It is identical in attached drawing
Appended drawing reference indicate element functionally identical or similar.Although the various aspects of embodiment are shown in the attached drawings, remove
It non-specifically points out, it is not necessary to attached drawing drawn to scale.
Dedicated word " exemplary " means " being used as example, embodiment or illustrative " herein.Here as " exemplary "
Illustrated any embodiment should not necessarily be construed as preferred or advantageous over other embodiments.
In addition, giving numerous details in specific embodiment below to better illustrate the disclosure.
It will be appreciated by those skilled in the art that without certain details, the disclosure equally be can be implemented.In some instances, for
Method, means, element and circuit well known to those skilled in the art are not described in detail, in order to highlight the purport of the disclosure.
Fig. 1 shows a kind of flow diagram for block chain data processing method that a kind of embodiment of the disclosure provides.Specifically
, as described in Figure 1, the method may include:
S110: identical input data is inputted into multiple parallel branch parallel.
Wherein, the multiple parallel branch can be multiple parallel processors, be also possible to the multiple of a processor
Parallel processing branches.
In a kind of embodiment of the disclosure, the input data may include Hash initial value H, Hash constant K.Input data is also
It may include the value of part field in block head data, such as Nerk root (hashmerkleroot), timestamp (nTime), version
The value of fields such as this number (nversion).
Further, in a kind of embodiment of the disclosure, the input data may include 256bit, 8 Hash initial value H,
It is to stablize constant for first Hash calculation stage1;It can also include 2048bit, 64 Hash constant K, for stage1
It is also to stablize constant;It can also include block head data.
In a kind of embodiment of the disclosure, block head (blockheader) data contain 6 fields altogether:
Int32_t nVersion, 4 bytes, version number generally immobilize, and only change in upgrading.
Uint256 hashPrevBlock, 32 bytes, the block head Hash of previous block, by previous block determining.
Uint256 hashMerkleRoot, 32 bytes, the Merkle root of the All Activity construction comprising time zone block, adjustment
Transaction order, additions and deletions transaction or modification Coinbase in block change when trading.
Uint32_t nTime, 4 bytes, timestamp, the latter block time are allowed slightly before previous block,
But must section at a reasonable time, generally can directly use machine current time stamp.
Uint32_t nBits, 4 bytes are dug mine disaster degree, are determined by the whole network, every 2016 blocks are algorithmically readjusted.
Uint32_t nNonce, 4 bytes, random number provide 2^32 kind value.I.e. 4,294,967,296.
Wherein, nVersion, hashPrevBlock, nBits are fixed, other hashMerkleRoot, nTime,
NNonce is variable.Bit coin digs mine principle that is, variable value (such as random number field constantly in change block head
NNonce), so that doing dual SHA256 Hash to block head, as a result it is less than and digs mine disaster degree target value, it may be assumed that SHA256D
(BlockHeader) < F (nBits), wherein SHA256D (BlockHeader) is dual SHA256 Hash, F to block head
(nBits) the difficulty target value calculated by nBits.
S120: the multiple parallel branch is based on the input data and carries out parallel processing to block head data, to area
During build data carry out parallel processing, the multiple parallel branch is directed to the random number field of the block head data,
The initial position random number nonce_sta of multiple and different Parallel Intervals is carried out parallel to final position random number nonce_fin's
Cumulative iteration.
Each parallel branch can carry out cumulative iteration to the random number field of block head data in different Parallel Intervals,
And it executes related algorithm and block head data is handled.
By the multiple identical input datas of parallel processing, while utilizing multiple parallel branch parallel processing difference sections
The cumulative iterative calculation of random number nonce can effectively reduce the time-consuming of random number nonce iterative calculation, to effectively improve
Data-handling efficiency.
In a kind of embodiment of the disclosure, the initial position random number nonce_ for carrying out multiple and different Parallel Intervals parallel
Cumulative iteration of the sta to final position random number nonce_fin, comprising:
By the initial position random number nonce_sta of the multiple Parallel Interval, the multiple parallel branch is inputted respectively,
Wherein each Parallel Interval includes respective initial position random number nonce_sta and final position random number nonce_fin;
Using the multiple parallel branch by the initial position random number nonce_sta of multiple Parallel Intervals, add up
Iteration is to final position random number nonce_fin.
Wherein it is possible to determine that entirety needs iteration according to initial initial position random number and initial final position random number
Data interval;And the data interval is divided into the multiple Parallel Interval.Multiple Parallel Intervals can be according to parallel branch
The degree of parallelism on road is divided.
Fig. 3 is the allocation flow schematic diagram for the parallel processing that a kind of embodiment of the disclosure provides.As shown in figure 3, difference is simultaneously
The input data of row branch is identical, and is constant;Nonce_sta the and nonce_fin configuration mode of parallel branch is as follows:
1, initial nonce_sta, initial nonce_fin are inputted, at the beginning of needing the data interval offset=of iteration for entirety
Beginning nonce_fin-initial nonce_sta;
2, according to the degree of parallelism n of the parallel branch, the i.e. quantity of parallel branch, respectively the section offset is at corresponding to simultaneously
The Parallel Interval (nonce_sta_0, nonce_fin_0) ... (nonce_sta_n, nonce_fin_n) of row branch;Every branch
Road parallel computation respectively Parallel Interval nonce add up iteration.
Specifically, such as initial nonce_sta=0, initial nonce_fin=99, parallel branch is 4, i.e., branch is simultaneously
Row degree n=4.4 Parallel Intervals are then divided, 1 (nonce_sta_0=0 of Parallel Interval is handled by parallel branch 1;nonce_fin_
0=24), parallel branch 2 handles 2 (nonce_sta_1=25 of Parallel Interval;Nonce_fin_1=49), parallel branch 3 is handled
3 (nonce_sta_2=50 of Parallel Interval;Nonce_fin_2=74), parallel branch 4 handles 4 (nonce_sta_3 of Parallel Interval
=75;Nonce_fin_3=99).Every branch changes according to the Parallel Interval of nonce_sta to the nonce_fin of distribution
For operation.Since other than nonce value, the input data of first order hash operation is identical, it is possible to carry out parallel iteration fortune
It calculates, guesss out hit field faster, improve mine machine and calculate power.It is time-consuming to reduce iterative calculation, data-handling efficiency is provided.
Certainly, above-mentioned configuration mode is only exemplary, can be according to specific parallel in disclosure other embodiments
The quantity of branch and the entirety of initial random number nonce to be treated need the data interval offset of iteration, and distribution is parallel
The concrete mode of processing, specifically, the disclosure is not construed as limiting this.
In the various embodiments described above, the cumulative iteration of nonce_sta to the nonce_fin of different Parallel Intervals can be used
Sha256 digs mine algorithm process.Fig. 5 is a kind of algorithm flow schematic diagram for sha256 algorithm that a kind of embodiment of the disclosure provides,
Specifically, remainder is filled as shown in figure 5, it is to be cut into the data of random length N* [64 byte] that sha256, which digs mine algorithm,
It.Then the data summarization of 32 bytes is calculated, and n times result is separated according to 4 bytes and is added certainly.
Fig. 2 shows a kind of modular structure schematic diagrams for block chain data processing equipment that a kind of embodiment of the disclosure provides.
Specifically, as shown in Fig. 2, the apparatus may include:
Input unit 101 can be used for identical input data inputting multiple parallel branch parallel;
Parallel processing element 102 can be configured as the multiple parallel branch and be based on the input data to block head
Data carry out parallel processing, and during carrying out parallel processing to block head data, the multiple parallel branch is for described
The random number field of block head data carries out the initial position random number nonce_sta of multiple and different Parallel Intervals to eventually parallel
Stop bit sets the cumulative iteration of random number nonce_fin.
In a kind of embodiment of the disclosure, the parallel processing element 102 can be configured to:
By the initial position random number nonce_sta of the multiple Parallel Interval, the multiple parallel branch is inputted respectively,
Wherein each Parallel Interval includes respective initial position random number nonce_sta and final position random number nonce_fin;
Using the multiple parallel branch by the initial position random number nonce_sta of multiple Parallel Intervals, add up
Iteration is to final position random number nonce_fin.
In a kind of embodiment of the disclosure, described device can also include:
Control unit 103 is configured as being determined whole according to initial initial position random number and initial final position random number
Body needs the data interval of iteration;
The data interval is divided into the multiple Parallel Interval.
In a kind of embodiment of the disclosure, the data interval, which is divided into the multiple Parallel Interval, may include:
According to the degree of parallelism of the parallel branch, the data interval is divided into the multiple Parallel Interval.
In a kind of embodiment of the disclosure, the input data may include Hash initial value and Hash constant.
In a kind of embodiment of the disclosure, described device can also include:
Data storage cell 104 can be used for storing the metadata digest information of hit;
Interface unit 105 is used for reading and writing data and parameter configuration, i.e., for receiving the interactive controlling of external control devices.
For be related in above-mentioned apparatus with the same or similar process in Fig. 1, Fig. 3, embodiment illustrated in fig. 5, specifically
Executive mode can be executed according to executive mode provided by the corresponding each embodiment of Fig. 1, Fig. 3, Fig. 5.
Fig. 6 shows a kind of structural schematic diagram for block chain data processing system that a kind of embodiment of the disclosure provides.It needs
Illustrate, device or system described above can also include other embodiments according to the description of embodiment of the method, specifically
Implementation be referred to the description of related method embodiment, do not repeat one by one herein.
Fig. 7 is shown according to an exemplary embodiment a kind of for executing the block diagram of the device 800 of the above method.Example
Such as, device 800 can be mobile phone, computer, digital broadcasting terminal, messaging device, game console, and plate is set
It is standby, Medical Devices, body-building equipment, personal digital assistant etc..
Referring to Fig. 7, device 800 may include following one or more components: processing component 802, memory 804, power supply
Component 806, multimedia component 808, audio component 810, the interface 812 of input/output (I/O), sensor module 814, and
Communication component 816.
The integrated operation of the usual control device 800 of processing component 802, such as with display, telephone call, data communication, phase
Machine operation and record operate associated operation.Processing component 802 may include that one or more processors 820 refer to execute
It enables, to perform all or part of the steps of the methods described above.In addition, processing component 802 may include one or more modules, just
Interaction between processing component 802 and other assemblies.For example, processing component 802 may include multi-media module, it is more to facilitate
Interaction between media component 808 and processing component 802.
Memory 804 is configured as storing various types of data to support the operation in device 800.These data are shown
Example includes the instruction of any application or method for operating on device 800, contact data, and telephone book data disappears
Breath, picture, video etc..Memory 804 can be by any kind of volatibility or non-volatile memory device or their group
It closes and realizes, such as static random access memory (SRAM), electrically erasable programmable read-only memory (EEPROM) is erasable to compile
Journey read-only memory (EPROM), programmable read only memory (PROM), read-only memory (ROM), magnetic memory, flash
Device, disk or CD.
Power supply module 806 provides electric power for the various assemblies of device 800.Power supply module 806 may include power management system
System, one or more power supplys and other with for device 800 generate, manage, and distribute the associated component of electric power.
Multimedia component 808 includes the screen of one output interface of offer between described device 800 and user.One
In a little embodiments, screen may include liquid crystal display (LCD) and touch panel (TP).If screen includes touch panel, screen
Curtain may be implemented as touch screen, to receive input signal from the user.Touch panel includes one or more touch sensings
Device is to sense the gesture on touch, slide, and touch panel.The touch sensor can not only sense touch or sliding action
Boundary, but also detect duration and pressure associated with the touch or slide operation.In some embodiments, more matchmakers
Body component 808 includes a front camera and/or rear camera.When device 800 is in operation mode, such as screening-mode or
When video mode, front camera and/or rear camera can receive external multi-medium data.Each front camera and
Rear camera can be a fixed optical lens system or have focusing and optical zoom capabilities.
Audio component 810 is configured as output and/or input audio signal.For example, audio component 810 includes a Mike
Wind (MIC), when device 800 is in operation mode, when such as call mode, recording mode, and voice recognition mode, microphone is matched
It is set to reception external audio signal.The received audio signal can be further stored in memory 804 or via communication set
Part 816 is sent.In some embodiments, audio component 810 further includes a loudspeaker, is used for output audio signal.
I/O interface 812 provides interface between processing component 802 and peripheral interface module, and above-mentioned peripheral interface module can
To be keyboard, click wheel, button etc..These buttons may include, but are not limited to: home button, volume button, start button and lock
Determine button.
Sensor module 814 includes one or more sensors, and the state for providing various aspects for device 800 is commented
Estimate.For example, sensor module 814 can detecte the state that opens/closes of device 800, and the relative positioning of component, for example, it is described
Component is the display and keypad of device 800, and sensor module 814 can be with 800 1 components of detection device 800 or device
Position change, the existence or non-existence that user contacts with device 800,800 orientation of device or acceleration/deceleration and device 800
Temperature change.Sensor module 814 may include proximity sensor, be configured to detect without any physical contact
Presence of nearby objects.Sensor module 814 can also include optical sensor, such as CMOS or ccd image sensor, at
As being used in application.In some embodiments, which can also include acceleration transducer, gyro sensors
Device, Magnetic Sensor, pressure sensor or temperature sensor.
Communication component 816 is configured to facilitate the communication of wired or wireless way between device 800 and other equipment.Device
800 can access the wireless network based on communication standard, such as WiFi, 2G or 3G or their combination.In an exemplary implementation
In example, communication component 816 receives broadcast singal or broadcast related information from external broadcasting management system via broadcast channel.
In one exemplary embodiment, the communication component 816 further includes near-field communication (NFC) module, to promote short range communication.Example
Such as, NFC module can be based on radio frequency identification (RFID) technology, Infrared Data Association (IrDA) technology, ultra wide band (UWB) technology,
Bluetooth (BT) technology and other technologies are realized.
In the exemplary embodiment, device 800 can be believed by one or more application specific integrated circuit (ASIC), number
Number processor (DSP), digital signal processing appts (DSPD), programmable logic device (PLD), field programmable gate array
(FPGA), controller, microcontroller, microprocessor or other electronic components are realized, for executing the above method.
In the exemplary embodiment, a kind of non-volatile computer readable storage medium storing program for executing is additionally provided, for example including calculating
The memory 804 of machine program instruction, above-mentioned computer program instructions can be executed above-mentioned to complete by the processor 820 of device 800
Method.
Fig. 8 is shown according to an exemplary embodiment a kind of for executing the block diagram of the device 1900 of the above method.Example
Such as, device 1900 may be provided as a server.Referring to Fig. 8, device 1900 includes processing component 1922, further comprises
One or more processors and memory resource represented by a memory 1932, can be by processing component 1922 for storing
Execution instruction, such as application program.The application program stored in memory 1932 may include one or more
Each corresponds to the module of one group of instruction.In addition, processing component 1922 is configured as executing instruction, to execute the above method.
Device 1900 can also include that a power supply module 1926 be configured as the power management of executive device 1900, and one
Wired or wireless network interface 1950 is configured as device 1900 being connected to network and input and output (I/O) interface
1958.Device 1900 can be operated based on the operating system for being stored in memory 1932, such as Windows ServerTM, Mac
OS XTM, UnixTM, LinuxTM, FreeBSDTM or similar.
In the exemplary embodiment, a kind of non-volatile computer readable storage medium storing program for executing is additionally provided, for example including calculating
The memory 1932 of machine program instruction, above-mentioned computer program instructions can be executed by the processing component 1922 of device 1900 to complete
The above method.
The disclosure can be system, method and/or computer program product.Computer program product may include computer
Readable storage medium storing program for executing, containing for making processor realize the computer-readable program instructions of various aspects of the disclosure.
Computer readable storage medium, which can be, can keep and store the tangible of the instruction used by instruction execution equipment
Equipment.Computer readable storage medium for example can be-- but it is not limited to-- storage device electric, magnetic storage apparatus, optical storage
Equipment, electric magnetic storage apparatus, semiconductor memory apparatus or above-mentioned any appropriate combination.Computer readable storage medium
More specific example (non exhaustive list) includes: portable computer diskette, hard disk, random access memory (RAM), read-only deposits
It is reservoir (ROM), erasable programmable read only memory (EPROM or flash memory), static random access memory (SRAM), portable
Compact disk read-only memory (CD-ROM), digital versatile disc (DVD), memory stick, floppy disk, mechanical coding equipment, for example thereon
It is stored with punch card or groove internal projection structure and the above-mentioned any appropriate combination of instruction.Calculating used herein above
Machine readable storage medium storing program for executing is not interpreted that instantaneous signal itself, the electromagnetic wave of such as radio wave or other Free propagations lead to
It crosses the electromagnetic wave (for example, the light pulse for passing through fiber optic cables) of waveguide or the propagation of other transmission mediums or is transmitted by electric wire
Electric signal.
Computer-readable program instructions as described herein can be downloaded to from computer readable storage medium it is each calculate/
Processing equipment, or outer computer or outer is downloaded to by network, such as internet, local area network, wide area network and/or wireless network
Portion stores equipment.Network may include copper transmission cable, optical fiber transmission, wireless transmission, router, firewall, interchanger, gateway
Computer and/or Edge Server.Adapter or network interface in each calculating/processing equipment are received from network to be counted
Calculation machine readable program instructions, and the computer-readable program instructions are forwarded, for the meter being stored in each calculating/processing equipment
In calculation machine readable storage medium storing program for executing.
Computer program instructions for executing disclosure operation can be assembly instruction, instruction set architecture (ISA) instructs,
Machine instruction, machine-dependent instructions, microcode, firmware instructions, condition setup data or with one or more programming languages
The source code or object code that any combination is write, the programming language include the programming language-of object-oriented such as
Smalltalk, C++ etc., and conventional procedural programming languages-such as " C " language or similar programming language.Computer
Readable program instructions can be executed fully on the user computer, partly execute on the user computer, be only as one
Vertical software package executes, part executes on the remote computer or completely in remote computer on the user computer for part
Or it is executed on server.In situations involving remote computers, remote computer can pass through network-packet of any kind
It includes local area network (LAN) or wide area network (WAN)-is connected to subscriber computer, or, it may be connected to outer computer (such as benefit
It is connected with ISP by internet).In some embodiments, by utilizing computer-readable program instructions
Status information carry out personalized customization electronic circuit, such as programmable logic circuit, field programmable gate array (FPGA) or can
Programmed logic array (PLA) (PLA), the electronic circuit can execute computer-readable program instructions, to realize each side of the disclosure
Face.
Referring herein to according to the flow chart of the method, apparatus (system) of the embodiment of the present disclosure and computer program product and/
Or block diagram describes various aspects of the disclosure.It should be appreciated that flowchart and or block diagram each box and flow chart and/
Or in block diagram each box combination, can be realized by computer-readable program instructions.
These computer-readable program instructions can be supplied to general purpose computer, special purpose computer or other programmable datas
The processor of processing unit, so that a kind of machine is produced, so that these instructions are passing through computer or other programmable datas
When the processor of processing unit executes, function specified in one or more boxes in implementation flow chart and/or block diagram is produced
The device of energy/movement.These computer-readable program instructions can also be stored in a computer-readable storage medium, these refer to
It enables so that computer, programmable data processing unit and/or other equipment work in a specific way, thus, it is stored with instruction
Computer-readable medium then includes a manufacture comprising in one or more boxes in implementation flow chart and/or block diagram
The instruction of the various aspects of defined function action.
Computer-readable program instructions can also be loaded into computer, other programmable data processing units or other
In equipment, so that series of operation steps are executed in computer, other programmable data processing units or other equipment, to produce
Raw computer implemented process, so that executed in computer, other programmable data processing units or other equipment
Instruct function action specified in one or more boxes in implementation flow chart and/or block diagram.
The flow chart and block diagram in the drawings show system, method and the computer journeys according to multiple embodiments of the disclosure
The architecture, function and operation in the cards of sequence product.In this regard, each box in flowchart or block diagram can generation
One module of table, program segment or a part of instruction, the module, program segment or a part of instruction include one or more use
The executable instruction of the logic function as defined in realizing.In some implementations as replacements, function marked in the box
It can occur in a different order than that indicated in the drawings.For example, two continuous boxes can actually be held substantially in parallel
Row, they can also be executed in the opposite order sometimes, and this depends on the function involved.It is also noted that block diagram and/or
The combination of each box in flow chart and the box in block diagram and or flow chart, can the function as defined in executing or dynamic
The dedicated hardware based system made is realized, or can be realized using a combination of dedicated hardware and computer instructions.
The presently disclosed embodiments is described above, above description is exemplary, and non-exclusive, and
It is not limited to disclosed each embodiment.Without departing from the scope and spirit of illustrated each embodiment, for this skill
Many modifications and changes are obvious for the those of ordinary skill in art field.The selection of term used herein, purport
In the principle, practical application or technological improvement to the technology in market for best explaining each embodiment, or lead this technology
Other those of ordinary skill in domain can understand each embodiment disclosed herein.
Claims (12)
1. a kind of block chain data processing method, which is characterized in that the described method includes:
Identical input data is inputted into multiple parallel branch parallel;
The multiple parallel branch be based on the input data to block head data carry out parallel processing, to block head data into
During row parallel processing, the multiple parallel branch is directed to the random number field of the block head data, and parallel progress is more
The cumulative iteration of the initial position random number nonce_sta to final position random number nonce_fin of a difference Parallel Interval.
2. a kind of block chain data processing method as described in claim 1, which is characterized in that it is described carry out parallel it is multiple and different
The cumulative iteration of the initial position random number nonce_sta to final position random number nonce_fin of Parallel Interval, comprising:
By the initial position random number nonce_sta of the multiple Parallel Interval, the multiple parallel branch is inputted respectively, wherein
Each Parallel Interval includes respective initial position random number nonce_sta and final position random number nonce_fin;
Using the multiple parallel branch by the initial position random number nonce_sta of multiple Parallel Intervals, add up iteration
To final position random number nonce_fin.
3. a kind of block chain data processing method as claimed in claim 1 or 2, which is characterized in that the method also includes:
According to initial initial position random number and initial final position random number, the whole data interval for needing iteration is determined;
The data interval is divided into the multiple Parallel Interval.
4. a kind of block chain data processing method as claimed in claim 3, which is characterized in that the data interval to be divided into
The multiple Parallel Interval includes:
According to the degree of parallelism of the parallel branch, the data interval is divided into the multiple Parallel Interval.
5. a kind of block chain data processing method as described in claim 1, which is characterized in that the input data includes Hash
Initial value and Hash constant.
6. a kind of block chain data processing equipment, which is characterized in that described device includes:
Input unit, for identical input data to be inputted multiple parallel branch parallel;
Parallel processing element is configured as the multiple parallel branch and is carried out parallel based on the input data to block head data
Processing, during carrying out parallel processing to block head data, the multiple parallel branch is for the block head data
Random number field carries out the initial position random number nonce_sta of multiple and different Parallel Intervals to final position random number parallel
The cumulative iteration of nonce_fin.
7. a kind of block chain data processing equipment as claimed in claim 6, which is characterized in that the parallel processing element, into
One step is configured as:
By the initial position random number nonce_sta of the multiple Parallel Interval, the multiple parallel branch is inputted respectively, wherein
Each Parallel Interval includes respective initial position random number nonce_sta and final position random number nonce_fin;
Using the multiple parallel branch by the initial position random number nonce_sta of multiple Parallel Intervals, add up iteration
To final position random number nonce_fin.
8. a kind of block chain data processing equipment as claimed in claims 6 or 7, which is characterized in that described device further include:
Control unit is configured as determining whole need according to initial initial position random number and initial final position random number
The data interval of iteration;
The data interval is divided into the multiple Parallel Interval.
9. a kind of block chain data processing equipment as claimed in claim 8, which is characterized in that the data interval to be divided into
The multiple Parallel Interval includes:
According to the degree of parallelism of the parallel branch, the data interval is divided into the multiple Parallel Interval.
10. a kind of block chain data processing equipment as claimed in claim 6, which is characterized in that the input data includes breathing out
Uncommon initial value and Hash constant.
11. a kind of block chain data processing equipment as claimed in claim 6, which is characterized in that described device further include:
Data storage cell, for storing the metadata digest information of hit;
Interface unit is used for reading and writing data and parameter configuration.
12. a kind of block chain data processing system, which is characterized in that the system comprises at least one processor and for depositing
The memory of processor-executable instruction is stored up, the processor realizes any one of claim 1 to 5 when executing described instruction
The method.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910824665.7A CN110535658A (en) | 2019-09-02 | 2019-09-02 | Block chain data processing method, apparatus and system |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910824665.7A CN110535658A (en) | 2019-09-02 | 2019-09-02 | Block chain data processing method, apparatus and system |
Publications (1)
Publication Number | Publication Date |
---|---|
CN110535658A true CN110535658A (en) | 2019-12-03 |
Family
ID=68666412
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201910824665.7A Pending CN110535658A (en) | 2019-09-02 | 2019-09-02 | Block chain data processing method, apparatus and system |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN110535658A (en) |
Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20180006808A1 (en) * | 2016-06-29 | 2018-01-04 | Intel Corporation | Optimized sha-256 datapath for energy-efficient high-performance bitcoin mining |
JP2018018348A (en) * | 2016-07-28 | 2018-02-01 | Kddi株式会社 | System for creating block chain, and program |
CN108958925A (en) * | 2018-04-26 | 2018-12-07 | 武汉龙津科技有限公司 | A kind of energy-efficient proof of work method and system |
CN109087105A (en) * | 2018-08-31 | 2018-12-25 | 深圳付贝科技有限公司 | For digging the Hash Search method of mine, digging mine machine and block catenary system |
CN109242491A (en) * | 2018-08-31 | 2019-01-18 | 深圳付贝科技有限公司 | It digs mine identity identifying method, dig mine machine and block catenary system |
CN109242299A (en) * | 2018-08-31 | 2019-01-18 | 深圳付贝科技有限公司 | Distribution digs mine method, digs mine machine and block catenary system |
CN109284190A (en) * | 2018-09-20 | 2019-01-29 | 中链科技有限公司 | A kind of task processing method and device |
-
2019
- 2019-09-02 CN CN201910824665.7A patent/CN110535658A/en active Pending
Patent Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20180006808A1 (en) * | 2016-06-29 | 2018-01-04 | Intel Corporation | Optimized sha-256 datapath for energy-efficient high-performance bitcoin mining |
JP2018018348A (en) * | 2016-07-28 | 2018-02-01 | Kddi株式会社 | System for creating block chain, and program |
CN108958925A (en) * | 2018-04-26 | 2018-12-07 | 武汉龙津科技有限公司 | A kind of energy-efficient proof of work method and system |
CN109087105A (en) * | 2018-08-31 | 2018-12-25 | 深圳付贝科技有限公司 | For digging the Hash Search method of mine, digging mine machine and block catenary system |
CN109242491A (en) * | 2018-08-31 | 2019-01-18 | 深圳付贝科技有限公司 | It digs mine identity identifying method, dig mine machine and block catenary system |
CN109242299A (en) * | 2018-08-31 | 2019-01-18 | 深圳付贝科技有限公司 | Distribution digs mine method, digs mine machine and block catenary system |
CN109284190A (en) * | 2018-09-20 | 2019-01-29 | 中链科技有限公司 | A kind of task processing method and device |
Non-Patent Citations (3)
Title |
---|
ALPHABET_1024: "(六)区块的生成、验证及挖矿", 《简书》 * |
张成成: "区块链典型挖矿算法分析", 《数字技术与应用》 * |
若丶相见: "加密算法原理分析(MD5、SHA-256)", 《稀土掘金》 * |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN108259991A (en) | Method for processing video frequency and device | |
CN108093315A (en) | Video generation method and device | |
CN107729522A (en) | Multimedia resource fragment intercept method and device | |
CN110458102A (en) | A kind of facial image recognition method and device, electronic equipment and storage medium | |
CN109887515A (en) | Audio-frequency processing method and device, electronic equipment and storage medium | |
CN107678888A (en) | database data backup method and device | |
CN110209877A (en) | Video analysis method and device | |
CN109388414A (en) | Method for upgrading software and device | |
CN109359218A (en) | Multimedia resource methods of exhibiting and device | |
CN108924644A (en) | Video clip extracting method and device | |
CN110322532A (en) | The generation method and device of dynamic image | |
CN110188871A (en) | Operation method, device and Related product | |
CN109241423A (en) | Information recommendation method, device, electronic equipment and storage medium | |
CN109934240A (en) | Feature update method and device, electronic equipment and storage medium | |
CN105094830A (en) | Method and device for executing target functions | |
CN108495162A (en) | Method for processing video frequency and device | |
CN106998493A (en) | The method for previewing and device of video | |
CN106782576A (en) | audio mixing method and device | |
CN109451358A (en) | Multimedia resource plays adjusting method and device | |
CN110312300A (en) | Control method, device and storage medium | |
CN109992754A (en) | Document processing method and device | |
CN108614659A (en) | Object selection method and device | |
CN108289229A (en) | The interactive approach and device of multimedia resource | |
CN109963205A (en) | Multimedia clips method and device | |
CN109064280A (en) | The methods of exhibiting and device of user's right |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
RJ01 | Rejection of invention patent application after publication | ||
RJ01 | Rejection of invention patent application after publication |
Application publication date: 20191203 |