CN105245327A - Optimizing method, device and circuit for Hash computing chip of bitcoin proof of work - Google Patents
Optimizing method, device and circuit for Hash computing chip of bitcoin proof of work Download PDFInfo
- Publication number
- CN105245327A CN105245327A CN201510520251.7A CN201510520251A CN105245327A CN 105245327 A CN105245327 A CN 105245327A CN 201510520251 A CN201510520251 A CN 201510520251A CN 105245327 A CN105245327 A CN 105245327A
- Authority
- CN
- China
- Prior art keywords
- input variable
- hash
- input
- circuit unit
- proof
- 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/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Storage Device Security (AREA)
Abstract
The invention discloses an optimizing method, device and circuit for Hash computing chip of bitcoin proof of work, and relates to the technical field of cipher computing, computer network and integrated circuits. The optimizing method comprises that a second input of the Hash computing chip is kept constant periodically, and when the second input is constant, a computing circuit corresponding to the second input is switched off; an initial first input of the Hash computing chip is changed, and a corresponding new first input is obtained; and Hash computing is carried out on each first input, the corresponding second input and a random number to search proof of work that satisfies the requirement, and each first input comprise the initial first input and the new first input. The method, device and circuit provided by the invention greatly reduce the power consumption of the circuit.
Description
Technical field
The present invention relates to cryptographic calculations, computer network and technical field of integrated circuits, particularly relate to method, device and circuit that a kind of bit coin proof of work Hash calculation chip is optimized.
Background technology
Digital encryption currency bit coin digs the compute mode in ore deposit see Fig. 1, by exhaustive random value 1nonce1 during computing, random value 2nonce2, random value nonce makes the end product of a series of Hash hash computing be less than value corresponding to current operation difficulty, then successfully find a bit coin block meeting agreement.Wherein by random value 1nocne1, after random value 2nonce2 and related data obtain transaction Hash merkle_hash by the relevant Hash operation carrying out meeting agreement, high 32bit and 32bitnonce of transaction Hash merkle_hash, and 32bit variable network difficulty nbit, time ntime also have other constants to form the 512bit message data of sha256 computing needs.And low 224bit data and 32bit variable protocol version ver form the 256bit state that sha256 computing needs.And general special circuit receives an assignment and only calculates twice last Hash operation.
Wherein, Sha256 computing is divided into expanded circuit unit and compressor circuit unit two parts, and expansion generates 64 4 byte datas (w0 ~ w63) 64 wheel compression circuit unit computings by 16 4 byte datas of message to use.The calculating process that the calculation process of composition graphs 2 is general changes random value 1nocne1, random value 2nonce2, calculate transaction root merkle_root, transaction root merkle_root and transaction tree carry out calculatings and obtain transaction Hash merkle_hash, calculate the value (traveling through the value of 32bitnonce) that transaction Hash merkle_hash (intermediate object program) all changes random number nonce afterwards at every turn and find the data meeting difficulty requirement.The first time expansion of Hash operation and compression process all need each change.Expanded circuit cell mesh can not stop change due to the change of random number nonce, simultaneously because to input the first input variable midstate constant in the outside of compressor circuit unit, but the w0 ~ w63 being input to compressor circuit cell mesh due to expanded circuit cell mesh can not stop change, the computing of compressor circuit cell mesh can be caused not stop change.
In current implementation method, exhaustive computations first time Hash operation input:
1) value of a new midstate is obtained;
2) do not stop the value changing random number nonce, search for qualified nonce;
3) the 1st is got back to) step, the many power consumptions of operand are large, and the technical problem needing those skilled in the art urgently to solve at present is exactly: how can innovatively propose a kind of effective measures, to meet more demands of practical application.
Summary of the invention
Embodiment of the present invention technical problem to be solved is to provide method, device and the circuit that a kind of bit coin proof of work Hash calculation chip is optimized, and greatly reduces the power consumption of circuit.
In order to solve the problem, the invention discloses a kind of method that bit coin proof of work Hash calculation chip is optimized, comprising:
Periodically keep the second input variable of Hash calculation chip constant; When the second input variable is constant, close the counting circuit corresponding with the second input variable;
Change the first input variable that Hash calculation chip is initial, and obtain corresponding the first new input variable;
Respectively the second corresponding with it for each first input variable input variable and random number are carried out Hash operation, to find the proof of work met the demands; Described each first input variable comprises described initial the first input variable and described the first input variable newly.
Further, the controling parameters of computing first input variable comprises version number, the cryptographic Hash of previous piece, conclude the business Hash, time, network difficulty and filler; Wherein, the controling parameters of Hash of concluding the business comprise first transaction beat money address, the signature that pond, ore deposit provides, the Hash tree of exchange unconfirmed formation, random value 1 and random value 2.
Further, the controling parameters combining the second input variable comprises rear 4 bytes of transaction Hash, time and network difficulty.
Further, the implementation method of the first input variable that described change Hash calculation chip is initial comprises: change version number.
Further, the implementation method of the first input variable that described change Hash calculation chip is initial comprises: change first transaction beat money address, signature that pond, ore deposit provides, random value 1 and or random value 2, rear 4 bytes of the Hash that makes to conclude the business in the first input variable are identical.
Further, the implementation method of the counting circuit that described closedown is corresponding to the second input variable comprises: close the clock circuit relevant with described corresponding counting circuit.
The present invention also disclosed the device that a kind of bit coin proof of work Hash calculation chip is optimized, and comprising:
First processing module, for periodically keeping the second input variable of Hash calculation chip constant; When the second input variable is constant, close the counting circuit corresponding with the second input variable;
Second processing module, for changing the first initial input variable of Hash calculation chip, and obtains corresponding the first new input variable;
3rd processing module, for respectively the second corresponding with it for each first input variable input variable and random number being carried out Hash operation, to find the proof of work met the demands; Described each first input variable comprises described initial the first input variable and described the first input variable newly.
The present invention also disclosed the circuit that a kind of bit coin proof of work Hash calculation chip is optimized, comprise at least two compressor circuit unit, expanded circuit unit and operation circuit unit, described compressor circuit unit is connected with expanded circuit unit, the output of described compressor circuit unit and expanded circuit unit, connect the input of described operation circuit unit, the input of described compressor circuit unit connects the first input variable, and the input of described compressor circuit unit connects the second input variable.
Compared with prior art, the present invention includes following advantage:
Scheme provided by the invention is by periodically keeping the second input variable of Hash calculation chip constant, change the first initial input variable of Hash calculation chip, and then obtain corresponding the first new input variable, the second corresponding with it respectively for the first new input variable of each correspondence of the first initial input variable and acquisition input variable and random number are carried out Hash operation, to find the proof of work met the demands, each the second constant input variable can carry out Hash operation with individual first input variable of N (N >=2), time constant based on the second input variable, the counting circuit corresponding with the second input variable is in closed condition, greatly reduce operand and power consumption.
Accompanying drawing explanation
In order to be illustrated more clearly in the embodiment of the present invention or technical scheme of the prior art, introduce doing one to the accompanying drawing used required in embodiment or description of the prior art simply below, apparently, accompanying drawing in the following describes is some embodiments of the present invention, for those of ordinary skill in the art, under the prerequisite not paying creative work, other accompanying drawing can also be obtained according to these accompanying drawings.
Fig. 1 is the compute mode schematic diagram that the digital encryption currency bit coin described in background technology digs ore deposit;
Fig. 2 is the calculation process schematic diagram described in background technology;
Fig. 3 is the method flow diagram that a kind of bit coin proof of work Hash calculation chip described in embodiment one is optimized;
Fig. 4 is the calculation flow chart described in embodiment one;
Fig. 5 is the device schematic diagram that the bit coin proof of work Hash calculation chip described in embodiment two is optimized;
Fig. 6 is the circuit diagram that the bit coin proof of work Hash calculation chip described in embodiment three is optimized.
Embodiment
For making the object of the embodiment of the present invention, technical scheme and advantage clearly, below in conjunction with the accompanying drawing in the embodiment of the present invention, technical scheme in the embodiment of the present invention is clearly and completely described, obviously, described embodiment is the present invention's part embodiment, instead of whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art, not making the every other embodiment obtained under creative work prerequisite, belong to the scope of protection of the invention.
Embodiment one
The method that a kind of bit coin proof of work Hash calculation chip that introducing the embodiment of the present invention in detail provides is optimized.
With reference to Fig. 3, show the method that a kind of bit coin proof of work Hash calculation chip of the present invention is optimized, comprising:
S301, periodically keeps the second input variable of Hash calculation chip constant; When the second input variable is constant, close the counting circuit corresponding with the second input variable;
S302, changes the first input variable that Hash calculation chip is initial, and obtains corresponding the first new input variable;
S303, carries out Hash operation by the second corresponding with it for each first input variable input variable and random number respectively, to find the proof of work met the demands; Described each first input variable comprises described initial the first input variable and described the first input variable newly.
By changing the first initial input variable of Hash calculation chip, periodic maintenance second input variable is constant, and then obtain corresponding the first new input variable, the second corresponding with it respectively for first input variable of the first initial input variable and Ge Xin input variable and random number are carried out Hash operation, to find the proof of work met the demands.
Respectively individual for N (N >=2) the first input variable and the second input variable and random number are carried out Hash operation in specific implementation process, a random number is often changed in calculating process, it is carried out Hash operation respectively with N number of first input variable together with the second input variable, second input variable periodically remains unchanged, through N computing change once, operand and the running time of the second input variable just become 1/N.When the second input variable is constant time, close corresponding counting circuit, reach the object effectively reducing power consumption.In application, usually adopt and close the closedown that the clock circuit relevant to described corresponding counting circuit realizes counting circuit.Wherein, the controling parameters of described first input variable comprises version number, the cryptographic Hash of previous piece, conclude the business Hash, time, network difficulty and filler; Wherein, the controling parameters of Hash of concluding the business comprise first transaction beat money address, the signature that pond, ore deposit provides, the Hash tree of exchange unconfirmed formation, random value 1 and random value 2.The mode obtaining the first initial input variable of chip obtains by carrying out computing to the controling parameters of the first input variable.Random number is converted by chip controls.
More specifically calculation flow chart is see Fig. 4, first by changing random value 1nocne1, random value 2nonce2 finds the identical transaction Hash merkle_hash of low 32bit, certain 2bit as the 32bit and random value 2nonce2 that travel through random value 1nonce1 at every turn calculates the result of all transaction Hash merkle_hash, so just there is the transaction Hash merkle_hash of 2^34 operation result, then these transaction Hash merkle_hash is divided into groups according to highest order 32bit, average so often group has 4 Hash merkle_hash (low 32bit is identical) of concluding the business, then by under group, computing is carried out to transaction Hash merkle_hash and random number.Wherein, the acquisition of Hash merkle_hash of concluding the business comprises and calculating Hash root merkle_root and transaction tree.Concrete passes through random value 1nocne1, random value 2nonce2 calculates Hash root merkle_root, and store Hash root merkle_root and relevant information thereof, when obtaining the transaction Hash merkle_hash of preset group number, send merkle_hash in groups, each value all changing random number nonce finds the data meeting difficulty and require, until random number nonce uses up, waits the merkle_hash next time sent in groups to be obtained.
The condition that the low 32bit of the transaction Hash merkle_hash that computing demand fulfillment calculates is identical just can be carried out, and a kind of implementation method in practical application uses multiple version number ver to carry out computing, also namely changes version number;
Version number in bit coin agreement can coexist Liang Ge version number under normal circumstances simultaneously.So often calculate a merkle_hash utilizes two or more version numbers coexisted to carry out multiple midstate computing so simultaneously.
Simultaneously can also by finding multiple low 32 (rear 4 bytes) identical transaction Hash merkle_hash, then computing is carried out, also namely by change first transaction beat money address, signature that pond, ore deposit provides, random value 1 and or random value 2 change the first input variable, ensure that the second input variable is constant simultaneously.
Supplementary introduction, proof of work (Proof-of-Work), in order to build the time stamp server of a component dispersion on point-to-point basis, it is inadequate for only working as newspaper or worldwide news network group, the Hash cash (Hashcash) that we also need to be similar to Adam Bai Ke (AdamBack) and to propose
6.When carrying out random hash computing, proof of work mechanism introduces the scanning work to some particular values, and for example under SHA-256, random hash value starts with one or more 0.So along with 0 the rising of number, find this to separate, required workload will exponentially increase, but assay only needs a random hash computing.We mend increasing random number (Nonce) within a block, and that the random hash value of this given block will have been made to occur is required so multiple 0 for this random number.We find this random number by making repeated attempts, till finding.We just construct a proof of work mechanism like this.As long as the workload that this CPU expends can meet this proof of work mechanism, unless so again completed suitable workload, the information of this block just can not be changed.After block is afterwards linked at this block, so want to change the information in this block, whole workloads of all blocks after just also needing again to complete.
Meanwhile, this proof of work mechanism also solves when collective vote is decided by vote, and who is most problem.If determine that most mode is IP address-based, IP address one ticket, if so there is people to have the power of distributing a large amount of IP address, then this mechanism is just destroyed.The essence of proof of work mechanism is then CPU mono-ticket.The decision of " great majority " is expressed as the longest chain, because the longest chain contains maximum workload.If most CPU is honest node control, so honest chain extends with the fastest speed, and surmounts other competition chain.If want the block to already having occurred to modify, assailant again must complete workload this block additional of this block after the workload of all blocks, and finally catch up with and surmount the workload of honest node.Imagine the block that a slower assailant attempts to catch up with subsequently, so its probability of success exponentially will be changed and successively decrease.Another problem is, the arithmetic speed of hardware is in rapid growth, and the degree of node participation network can rise and fall to some extent.In order to address this problem, employing rolling average order calibration method is determined by the difficulty (theproof-of-workdifficulty) of proof of work, makes the speed of generation block per hour be a certain default average even difficulty is pointed to.If the excessive velocities that block generates, so difficulty will improve.
Bit coin attracts the concern of more and more people as a kind of valuable electronic money in recent years, increasing people pays close attention to and invests bit coin, bit coin makes cash system run under point-to-point environment, network adds timestamp (timestamps) by random hash (hashing) to all concluding the business, they are integrated with the chain of the proof of work based on random hash (proof-of-work) that constantly extends as transaction record, this transaction record has unalterable feature.The longest chain not only using the proof as the sequence of events be observed (sequence), and is seen as from the maximum pond (pool) of CPU computing capability.As long as most CPU computing capability is not all intended cooperation and got up and to attack the whole network, so honest node will generate chain that is the longest, that exceed assailant.Information is tried one's best and to be propagated at the whole network, and node (nodes) can leave at any time and rejoin network, and using the proof of the longest proof of work chain as the transaction occurred during this node off-line.
Concrete, the step running this network is as follows:
1) new transaction is broadcasted to the whole network;
2) Transaction Information received is included in a block by each node;
3) each node is attempted in the block of oneself, find a proof of work with enough difficulty;
4) when a node have found a proof of work, it is just broadcasted to the whole network;
5) and if only if the All Activity be included in this block is all effective and did not exist before, and other nodes just admit the validity of this block;
6) other nodes represent that they accept this block, and represent the method accepted, be then at the end of following this block, manufacture new block to extend this chain, and the random hash value being accepted block is considered as the random hash value fast prior to new district.
The longest chain is all considered as correct chain by node all the time, and continuous firing and prolongation it.If there are two nodes to broadcast the new block of different editions simultaneously, so will there is successively difference in other nodes on the time receiving this block.When this situation, they carry out work by the block basis taking the lead in receiving, but also can retain another one chain, in case the latter becomes the longest chain.Breaking of this deadlock will wait until that next proof of work is found, and a chain to be wherein proved to be longer one, the node so worked on another branch's chain will change camp, start to work on longer chain.
So-called " new transaction will be broadcasted ", does not in fact need to arrive at whole nodes.As long as Transaction Information can arrive at abundant node, so they will be integrated in a block very soon.And the broadcast of block has fault-tolerant ability to the information be dropped.If a node does not receive certain particular block, so this node will find oneself to have lacked certain block, also just can propose the request of oneself downloading this block.
We arrange so: particularization process is carried out in the first stroke transaction of each block, and this transaction produces one piece of new electronic money had by this block creator.Which adds the excitation that node supports this network, and when there is no centralized authority releases currency, provide a kind of a kind of method electronic money being assigned to the field of circulation.This method some new money being continued be added in money-system, is very similar to consumes resources and goes excavate gold mine and gold is injected into the field of circulation.Now, time of CPU and power consumption are exactly the resource consumed.The source of another one excitation is then transaction fee (transactionfees).If the output valve of certain transaction is less than input value, so difference is exactly transaction fee, and this transaction fee will be added in the excitation of this block.As long as the electronic money of given amount circulates, so incentive mechanism just can be converted to gradually and rely on transaction fee completely, and so this money-system just can avoid inflation.
In addition, the principle based on SHA-256 is well-known to those skilled in the art, no longer carries out supplementing to it here and introduces.
Embodiment two
The device that a kind of bit coin proof of work Hash calculation chip that introducing the embodiment of the present invention in detail provides is optimized.
See Fig. 5, show the device that bit coin proof of work Hash calculation chip of the present invention is optimized, concrete comprises:
First processing module 501, for periodically keeping the second input variable of Hash calculation chip constant; When the second input variable is constant, close the counting circuit corresponding with the second input variable;
Second processing module 502, for changing the first initial input variable of Hash calculation chip, and obtains corresponding the first new input variable;
3rd processing module 503, for respectively the second corresponding with it for each first input variable input variable and random number being carried out Hash operation, to find the proof of work met the demands; Described each first input variable comprises described initial the first input variable and described the first input variable newly.
Embodiment three
The circuit that a kind of bit coin proof of work Hash calculation chip that introducing the embodiment of the present invention in detail provides is optimized.
With reference to Fig. 6, show the circuit that a kind of bit coin of the present invention proof of work Hash calculation chip is optimized, comprise at least two compressor circuit unit 601, expanded circuit unit 602 and operation circuit unit 603, described compressor circuit unit 601 is connected with expanded circuit unit 602, the output of described compressor circuit unit 601 and expanded circuit unit 602, connect the input of described operation circuit unit 603, the input of described compressor circuit unit 601 connects the first input variable, and the input of described compressor circuit unit 602 connects the second input variable.
Be introduced for the individual compressor circuit unit of N (N >=2) in the present embodiment, corresponding compressor circuit unit is respectively the first compressor circuit unit 6011, second compressor circuit unit 6012 ... N compressor circuit 601N.N number of compressor circuit unit shares an expanded circuit unit, is very simply described with N=2, and the circuit scale due to the expanded circuit cell mesh that have shared compressor circuit unit drops to 1/2 and power consumption also reduces to traditional 1/2 half.In like manner, during N=n, the circuit scale of expanded circuit cell mesh drops to 1/n and power consumption also reduces to traditional 1/n half.
Each embodiment in this specification all adopts the mode of going forward one by one to describe, and what each embodiment stressed is the difference with other embodiments, between each embodiment identical similar part mutually see.
Above to method, device and circuit that a kind of bit coin proof of work Hash calculation chip provided by the present invention is optimized, be described in detail, apply specific case herein to set forth principle of the present invention and execution mode, the explanation of above embodiment just understands realization of the present invention and core concept thereof for helping; Meanwhile, for one of ordinary skill in the art, according to thought of the present invention, all will change in specific embodiments and applications, in sum, this description should not be construed as limitation of the present invention.
Claims (8)
1. a method for bit coin proof of work Hash calculation chip optimization, is characterized in that, comprising:
Periodically keep the second input variable of Hash calculation chip constant; When the second input variable is constant, close the counting circuit corresponding with the second input variable;
Change the first input variable that Hash calculation chip is initial, and obtain corresponding the first new input variable;
Respectively the second corresponding with it for each first input variable input variable and random number are carried out Hash operation, to find the proof of work met the demands; Described each first input variable comprises described initial the first input variable and described the first input variable newly.
2. method according to claim 1, is characterized in that, the controling parameters of computing first input variable comprises version number, the cryptographic Hash of previous piece, conclude the business Hash, time, network difficulty and filler; Wherein, the controling parameters of Hash of concluding the business comprise first transaction beat money address, the signature that pond, ore deposit provides, the Hash tree of exchange unconfirmed formation, random value 1 and random value 2.
3. method according to claim 1, is characterized in that, the controling parameters combining the second input variable comprises rear 4 bytes of transaction Hash, time and network difficulty.
4. method according to claim 1, it is characterized in that, the implementation method of the first input variable that described change Hash calculation chip is initial comprises: change version number.
5. method according to claim 1, it is characterized in that, the implementation method of the first input variable that described change Hash calculation chip is initial comprises: change first transaction beat money address, signature that pond, ore deposit provides, random value 1 and or random value 2, rear 4 bytes of the Hash that makes to conclude the business in the first input variable are identical.
6. method according to claim 1, is characterized in that, the implementation method of the counting circuit that described closedown is corresponding to the second input variable comprises: close the clock circuit relevant with described corresponding counting circuit.
7. a device for bit coin proof of work Hash calculation chip optimization, is characterized in that, comprising:
First processing module, for periodically keeping the second input variable of Hash calculation chip constant; When the second input variable is constant, close the counting circuit corresponding with the second input variable;
Second processing module, for changing the first initial input variable of Hash calculation chip, and obtains corresponding the first new input variable;
3rd processing module, for respectively the second corresponding with it for each first input variable input variable and random number being carried out Hash operation, to find the proof of work met the demands; Described each first input variable comprises described initial the first input variable and described the first input variable newly.
8. the circuit of a bit coin proof of work Hash calculation chip optimization, it is characterized in that, comprise at least two compressor circuit unit, expanded circuit unit and operation circuit unit, described compressor circuit unit is connected with expanded circuit unit, the output of described compressor circuit unit and expanded circuit unit, connect the input of described operation circuit unit, the input of described compressor circuit unit connects the first input variable, and the input of described compressor circuit unit connects the second input variable.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510520251.7A CN105245327A (en) | 2015-08-21 | 2015-08-21 | Optimizing method, device and circuit for Hash computing chip of bitcoin proof of work |
| PCT/CN2016/074518 WO2017031967A1 (en) | 2015-08-21 | 2016-02-25 | Method and device for optimizing hash computing chip for bitcoin proof-of-work, and circuit |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510520251.7A CN105245327A (en) | 2015-08-21 | 2015-08-21 | Optimizing method, device and circuit for Hash computing chip of bitcoin proof of work |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105245327A true CN105245327A (en) | 2016-01-13 |
Family
ID=55042840
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510520251.7A Pending CN105245327A (en) | 2015-08-21 | 2015-08-21 | Optimizing method, device and circuit for Hash computing chip of bitcoin proof of work |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN105245327A (en) |
| WO (1) | WO2017031967A1 (en) |
Cited By (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105741095A (en) * | 2016-01-29 | 2016-07-06 | 彭军红 | Dynamic compression and access method of block chain |
| CN106254339A (en) * | 2016-08-01 | 2016-12-21 | 北京比特大陆科技有限公司 | Dig safety certifying method and the system of mining industry business |
| CN106407008A (en) * | 2016-08-31 | 2017-02-15 | 北京比特大陆科技有限公司 | Mining business processing method, device and system |
| WO2017031967A1 (en) * | 2015-08-21 | 2017-03-02 | 北京比特大陆科技有限公司 | Method and device for optimizing hash computing chip for bitcoin proof-of-work, and circuit |
| CN106528292A (en) * | 2016-10-21 | 2017-03-22 | 杭州嘉楠耘智信息科技有限公司 | Task processing method and device |
| CN106547620A (en) * | 2016-10-21 | 2017-03-29 | 杭州嘉楠耘智信息科技有限公司 | Task processing method and device |
| CN107528854A (en) * | 2017-09-20 | 2017-12-29 | 江苏通付盾科技有限公司 | Connection method, system, client and server based on proof of work |
| CN107579814A (en) * | 2017-08-03 | 2018-01-12 | 北京比特大陆科技有限公司 | Device, computing chip, the digging ore deposit machine of the computational methods of proof of work |
| CN108322304A (en) * | 2018-02-28 | 2018-07-24 | 北京比特大陆科技有限公司 | The computational methods and device of proof of work, electronic equipment, program and medium |
| CN108389044A (en) * | 2018-02-28 | 2018-08-10 | 北京比特大陆科技有限公司 | The computational methods and system of proof of work, electronic equipment, program and medium |
| CN108777612A (en) * | 2018-05-18 | 2018-11-09 | 中科声龙科技发展（北京）有限公司 | A kind of optimization method and circuit of proof of work operation chip core calculating unit |
| CN109075964A (en) * | 2016-05-03 | 2018-12-21 | 安奎泰 | Support the block chain of multiple one-way functions for block verifying |
| CN109376115A (en) * | 2018-08-31 | 2019-02-22 | 北京智云芯科技有限公司 | A kind of computing device and calculation method based on proof of work |
| CN109829076A (en) * | 2017-08-22 | 2019-05-31 | 上海策赢网络科技有限公司 | A kind of method and apparatus generating block chain |
| CN109905228A (en) * | 2017-12-07 | 2019-06-18 | 北京智云芯科技有限公司 | A kind of dedicated computing circuit for realizing Hash operation |
| CN111082922A (en) * | 2018-10-18 | 2020-04-28 | 北京天能博信息科技有限公司 | Data processing method of block chain and related equipment |
| CN111352770A (en) * | 2020-02-27 | 2020-06-30 | 苏州市星际云通区块链科技有限公司 | Block chain backup system, backup method, block chain verification method and block chain verification system |
| CN113282802A (en) * | 2021-06-17 | 2021-08-20 | 浙江毫微米科技有限公司 | Workload certification algorithm optimization method and device, computer equipment and storage medium |
| CN113296705A (en) * | 2021-05-27 | 2021-08-24 | 浙江萤火虫区块链科技有限公司 | Architecture system for parallel computing Poseidon Hash in Filecin |
| WO2022174700A1 (en) * | 2021-02-20 | 2022-08-25 | 北京比特大陆科技有限公司 | Computing apparatus for proof of work, and asic chip and computing method for proof of work |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110430040B (en) * | 2019-07-31 | 2024-01-30 | 武汉芯昌科技有限公司 | Message expansion circuit in low-power SHA256 algorithm |
| CN111563277A (en) * | 2020-04-03 | 2020-08-21 | 上海坤振集成电路有限公司 | Workload proving method in block chain network and block chain |
| CN113282803B (en) * | 2021-06-17 | 2022-06-17 | 浙江毫微米科技有限公司 | Workload certification algorithm optimization method and device, computer equipment and storage medium |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101010690A (en) * | 2004-06-25 | 2007-08-01 | 佩珀尔硬币公司 | Payment processing method and system |
| CN101079141A (en) * | 2006-05-24 | 2007-11-28 | 国际商业机器公司 | Method for automatically validating a transaction, electronic payment system and computer program |
| CN102693378A (en) * | 1995-02-13 | 2012-09-26 | 英特特拉斯特技术公司 | Systems and methods for secure transaction management and electronic rights protection |
| US20140279540A1 (en) * | 2013-03-15 | 2014-09-18 | Fulcrum Ip Corporation | Systems and methods for a private sector monetary authority |
| CN203941481U (en) * | 2014-05-20 | 2014-11-12 | 广州市适马自动化控制科技有限公司 | A kind of bit coin digs ore deposit machine |
| US20150006895A1 (en) * | 2009-06-01 | 2015-01-01 | Maidsafe Foundation | Distributed network system |
| CN104463001A (en) * | 2014-12-19 | 2015-03-25 | 比特卡国际有限公司 | Method for independently generating and storing encrypted digital currency private key and device for bearing encrypted digital currency private key |
| WO2015077378A1 (en) * | 2013-11-19 | 2015-05-28 | Sunrise Tech Group, Llc | Block mining methods and apparatus |
| CN104850984A (en) * | 2014-05-13 | 2015-08-19 | 电子科技大学 | Safe operation method for offline payment of electronic money |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101201811B (en) * | 2006-12-11 | 2010-05-12 | 边立剑 | Encryption-decryption coprocessor for SOC |
| EP2293216A1 (en) * | 2008-06-23 | 2011-03-09 | Panasonic Corporation | Information processing device, information processing method, and computer program and integrated circuit for the realization thereof |
| JP2010128392A (en) * | 2008-11-28 | 2010-06-10 | Canon Inc | Hash processing apparatus and hash processing method |
| CN105245327A (en) * | 2015-08-21 | 2016-01-13 | 北京比特大陆科技有限公司 | Optimizing method, device and circuit for Hash computing chip of bitcoin proof of work |
-
2015
- 2015-08-21 CN CN201510520251.7A patent/CN105245327A/en active Pending
-
2016
- 2016-02-25 WO PCT/CN2016/074518 patent/WO2017031967A1/en active Application Filing
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102693378A (en) * | 1995-02-13 | 2012-09-26 | 英特特拉斯特技术公司 | Systems and methods for secure transaction management and electronic rights protection |
| CN101010690A (en) * | 2004-06-25 | 2007-08-01 | 佩珀尔硬币公司 | Payment processing method and system |
| CN101079141A (en) * | 2006-05-24 | 2007-11-28 | 国际商业机器公司 | Method for automatically validating a transaction, electronic payment system and computer program |
| US20150006895A1 (en) * | 2009-06-01 | 2015-01-01 | Maidsafe Foundation | Distributed network system |
| US20140279540A1 (en) * | 2013-03-15 | 2014-09-18 | Fulcrum Ip Corporation | Systems and methods for a private sector monetary authority |
| WO2015077378A1 (en) * | 2013-11-19 | 2015-05-28 | Sunrise Tech Group, Llc | Block mining methods and apparatus |
| CN104850984A (en) * | 2014-05-13 | 2015-08-19 | 电子科技大学 | Safe operation method for offline payment of electronic money |
| CN203941481U (en) * | 2014-05-20 | 2014-11-12 | 广州市适马自动化控制科技有限公司 | A kind of bit coin digs ore deposit machine |
| CN104463001A (en) * | 2014-12-19 | 2015-03-25 | 比特卡国际有限公司 | Method for independently generating and storing encrypted digital currency private key and device for bearing encrypted digital currency private key |
Non-Patent Citations (1)
| Title |
|---|
| 张嘉洺: "《电子货币系统研究及比特币挖矿优化》", 《中国优秀硕士学位论文全文数据库信息科技集》 * |
Cited By (32)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017031967A1 (en) * | 2015-08-21 | 2017-03-02 | 北京比特大陆科技有限公司 | Method and device for optimizing hash computing chip for bitcoin proof-of-work, and circuit |
| CN105741095A (en) * | 2016-01-29 | 2016-07-06 | 彭军红 | Dynamic compression and access method of block chain |
| CN109075964A (en) * | 2016-05-03 | 2018-12-21 | 安奎泰 | Support the block chain of multiple one-way functions for block verifying |
| CN109075964B (en) * | 2016-05-03 | 2021-12-10 | 安奎泰 | Block chaining supporting multiple one-way functions for block verification |
| CN106254339A (en) * | 2016-08-01 | 2016-12-21 | 北京比特大陆科技有限公司 | Dig safety certifying method and the system of mining industry business |
| CN106254339B (en) * | 2016-08-01 | 2019-05-07 | 北京比特大陆科技有限公司 | Dig the safety certifying method and system of mining industry business |
| CN106407008A (en) * | 2016-08-31 | 2017-02-15 | 北京比特大陆科技有限公司 | Mining business processing method, device and system |
| CN106407008B (en) * | 2016-08-31 | 2019-12-03 | 北京比特大陆科技有限公司 | Dig mine method for processing business, device and system |
| CN106547620B (en) * | 2016-10-21 | 2020-05-19 | 杭州嘉楠耘智信息科技有限公司 | Task processing method and device |
| CN106528292B (en) * | 2016-10-21 | 2022-04-22 | 上海嘉楠捷思信息技术有限公司 | Task processing method and device |
| CN106547620A (en) * | 2016-10-21 | 2017-03-29 | 杭州嘉楠耘智信息科技有限公司 | Task processing method and device |
| CN106528292A (en) * | 2016-10-21 | 2017-03-22 | 杭州嘉楠耘智信息科技有限公司 | Task processing method and device |
| CN107579814A (en) * | 2017-08-03 | 2018-01-12 | 北京比特大陆科技有限公司 | Device, computing chip, the digging ore deposit machine of the computational methods of proof of work |
| CN109829076A (en) * | 2017-08-22 | 2019-05-31 | 上海策赢网络科技有限公司 | A kind of method and apparatus generating block chain |
| CN107528854B (en) * | 2017-09-20 | 2020-11-13 | 江苏通付盾科技有限公司 | Connection method, system, client and server based on workload certification |
| CN107528854A (en) * | 2017-09-20 | 2017-12-29 | 江苏通付盾科技有限公司 | Connection method, system, client and server based on proof of work |
| CN109905228B (en) * | 2017-12-07 | 2023-07-25 | 北京智云芯科技有限公司 | Special computing circuit for realizing hash operation |
| CN109905228A (en) * | 2017-12-07 | 2019-06-18 | 北京智云芯科技有限公司 | A kind of dedicated computing circuit for realizing Hash operation |
| CN108389044A (en) * | 2018-02-28 | 2018-08-10 | 北京比特大陆科技有限公司 | The computational methods and system of proof of work, electronic equipment, program and medium |
| CN108322304B (en) * | 2018-02-28 | 2021-12-07 | 海峡小鹿有限公司 | Calculation method and apparatus for workload certification, electronic device, program, and medium |
| CN108322304A (en) * | 2018-02-28 | 2018-07-24 | 北京比特大陆科技有限公司 | The computational methods and device of proof of work, electronic equipment, program and medium |
| WO2019218730A1 (en) * | 2018-05-18 | 2019-11-21 | 中科声龙科技发展（北京）有限公司 | System and method for optimizing core computing components of proof of work operation chip |
| CN108777612B (en) * | 2018-05-18 | 2020-03-20 | 中科声龙科技发展（北京）有限公司 | Optimization method and circuit for workload certification operation chip core calculation component |
| CN108777612A (en) * | 2018-05-18 | 2018-11-09 | 中科声龙科技发展（北京）有限公司 | A kind of optimization method and circuit of proof of work operation chip core calculating unit |
| CN109376115A (en) * | 2018-08-31 | 2019-02-22 | 北京智云芯科技有限公司 | A kind of computing device and calculation method based on proof of work |
| CN111082922B (en) * | 2018-10-18 | 2021-11-19 | 北京天能博信息科技有限公司 | Data processing method of block chain and related equipment |
| CN111082922A (en) * | 2018-10-18 | 2020-04-28 | 北京天能博信息科技有限公司 | Data processing method of block chain and related equipment |
| CN111352770A (en) * | 2020-02-27 | 2020-06-30 | 苏州市星际云通区块链科技有限公司 | Block chain backup system, backup method, block chain verification method and block chain verification system |
| WO2022174700A1 (en) * | 2021-02-20 | 2022-08-25 | 北京比特大陆科技有限公司 | Computing apparatus for proof of work, and asic chip and computing method for proof of work |
| CN113296705A (en) * | 2021-05-27 | 2021-08-24 | 浙江萤火虫区块链科技有限公司 | Architecture system for parallel computing Poseidon Hash in Filecin |
| CN113282802A (en) * | 2021-06-17 | 2021-08-20 | 浙江毫微米科技有限公司 | Workload certification algorithm optimization method and device, computer equipment and storage medium |
| CN113282802B (en) * | 2021-06-17 | 2022-06-24 | 浙江毫微米科技有限公司 | Workload certification algorithm optimization method and device, computer equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2017031967A1 (en) | 2017-03-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105245327A (en) | Optimizing method, device and circuit for Hash computing chip of bitcoin proof of work | |
| Lei et al. | Groupchain: Towards a scalable public blockchain in fog computing of IoT services computing | |
| US20170300877A1 (en) | System and method for providing shared hash engines architecture for a bitcoin block chain | |
| CN109639430B (en) | Safe high-speed lightweight block chain system and method | |
| CN110855432B (en) | Asynchronous BFT & DPOS consensus mechanism for assigning verifier rewards based on verifiable random functions | |
| CN104915249A (en) | Method and device for digging virtual digital coins in mining pool | |
| US20170300875A1 (en) | Method and system for reducing power consumption in bitcoin mining via data input hopping | |
| EP3857850A1 (en) | High throughput blockchain consensus systems and methods with low finalization time | |
| CN109035011B (en) | Control method and system for block chain DAG width | |
| Lee et al. | Poster: A proof-of-stake (PoS) blockchain protocol using fair and dynamic sharding management | |
| CN107579814A (en) | Device, computing chip, the digging ore deposit machine of the computational methods of proof of work | |
| CN113032370A (en) | Design method of partitioned block chain system | |
| LeMahieu | Raiblocks: A feeless distributed cryptocurrency network | |
| WO2019125814A1 (en) | Blockchain based information security system and method | |
| Forestier et al. | Blockclique: scaling blockchains through transaction sharding in a multithreaded block graph | |
| CN111478795A (en) | Alliance block chain network consensus method based on mixed Byzantine fault tolerance | |
| Li et al. | ISCP: An Improved Blockchain Consensus Protocol. | |
| EP4022843A1 (en) | Methods and devices for secure symbiotic mining | |
| EP3970048A1 (en) | Systems and methods for non-parallelised mining on a proof-of-work blockchain network | |
| Wan et al. | AnonymousFox: An efficient and scalable blockchain consensus algorithm | |
| Ye et al. | Garou: An efficient and secure off-blockchain multi-party payment hub | |
| CN114614991A (en) | Block chain automatic settlement method and system suitable for small micro load aggregation response | |
| CN110661867A (en) | Block chain consensus method based on improved workload certification and equity certification | |
| US20220383304A1 (en) | Distributed network with consensus mechanism | |
| CN111327669A (en) | Decentralized block chain solution method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB03 | Change of inventor or designer information |
Inventor after: Zhan Ketuan Inventor after: Wu Jihan Inventor after: Duan Kai Inventor after: Xu Lingchao Inventor before: Zhan Ketuan Inventor before: Su Jie Inventor before: Wu Jihan Inventor before: Duan Kai Inventor before: Xu Lingchao |
|
| CB03 | Change of inventor or designer information | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20160113 |
|
| RJ01 | Rejection of invention patent application after publication |