Difference between Hashcash proof of work algorithm and Ethash proof of work algorithm?

Difference between Hashcash proof of work algorithm and Ethash proof of work algorithm?

Understand that each proof of work algorithm has its pros and cons.

Difference between Hashcash proof of work algorithm and Ethash proof of work algorithm?

Nathan Aw

https://ift.tt/2uoXxb1

Comments

Post a Comment

Popular posts from this blog

How do 'Sphinx' invoice-less payments on the Lightning Network work?

How do 'Sphinx' invoice-less payments on the Lightning Network work? There was recently a WIP draft published to the lnd Github, for a 'Sphinx payment mode' for Lightning Network nodes. To quote Roasbeef from the Github PR : [this allows] the ability to send a payment to a destination without first needing to have an invoice Though this is a WIP, it can apparently be used on mainnet already, as long as all nodes involved are upgraded to include the new code. So how does this work? At a high level, what does the UX look like? At a low level, what differences are there in terms of completing the payment (passing HTLCs around), compared to a standard LN transaction? Whats going on under the hood? http://bit.ly/2FoFIgP
Read more

How public key is calculated from a base58 encoded private key?

How public key is calculated from a base58 encoded private key? I followed this post and created a private key for bitcoin wallet. The post says after finding the random 256 bit(32 bytes) integer the version number should be prepended and the checksum should be appended to it. This produces a 37 bytes hex. Now I am trying to find the public key associated with this private key.I learnt that the PUBLIC key is calculated by applying ECDSA secp256k1 curve on the private key. But only 32 bytes is accepted as input by the ECDSA algorithm. So what am I doing wrong? Thanks in advance. http://bit.ly/2AvHLvg
Read more

Best way to calculate difficulty of generating specific vanity address?

Best way to calculate difficulty of generating specific vanity address? I'm now working at small tool, which purpose is to calculate difficulty (like number of attempts) of getting vanity address, like vanitygen ( https://github.com/samr7/vanitygen ) does. I've read some materials ( https://en.bitcoin.it/wiki/Vanitygen#Difficulty_of_finding_a_vanity ) and now i'm wondering about exact algorithm of how such calculation must be proceeded. There is no precise answer in the article at bitcoin.it wiki, so a look through the sources of vanitygen and ended up with some very basic ideas: All addresses are in a nutshell base58 numbers which can be converted to biginteger if needed. There is one final "biggest" address (like biggest number in the end of some range) Vanity address is any address from the range of addresses (if we think about them as numbers), that starts with specific pattern. So what is the best way of finding difficulty of getting specified vanity ad...
Read more