Topic: Steps to translate blockheader to current block hash. (Read 2585 times)

Thank you theymos. That code worked beautifully.

The hex2bin wasn't necessary at all actually since the hash function will return raw/binary data if you add "true" to the third argument (which you had done).

And the strrev needed to be modified a bit (created my own reverse function) that reverses two chars at a time instead of 1. Don't know why I had to do that but I did.

Now how to get the blocknumber from the block_hash via bitcoind? (Not that I don't love blockexplorer.com, theymos!)

Yeah, don't use base_convert().  Big red warning on the man page.

Try hex2bin() instead.

Well, I must be doing the hashing wrong then :S

I have the following code on my php page:


Basically it converts the string you provided into base 2 and then hashes the base 2 code with sha256.

And it shows: 60e05bd1b195af2f94112fa7197a5c88289058840ce7c6df9693756bc6250f55

So I did not get the first hash that you did (0cdb93c3412d2f30eb7d8dfd13d3142eaa8738c0de2337ac8a80c623715d9c07)

I have a feeling that my binary encoding is not correct. I am converting from base 16 to base 2.

Should I be using the PHP pack function perhaps?

If so, is the format "Hex string, low nibble first" or "Hex string, high nibble first"?

You do concatenate them. Hash this:

If you get a different first hash than I posted, then you're doing the hashing wrong. Maybe you forgot to convert this hexadecimal to binary...

I have answered my own question. Unfortunately that answer is "no".

Can somebody kindly show me just one full length string of text that I can hash twice and come up with a correct block hash?

I am sure if I could simply see the string and look at blockexplorer.com's raw data I could figure it out.

See this : http://forum.bitcoin.org/index.php?topic=11043.0

Because byte ordering in memory is different from byte order on the network.  There are a lot of different multi-byte word storage schemes in use by different CPU families.  The network byte order is the common standard, and each machine is responsible for converting to and from it.  It gets trickier with hashing like this, since some parts of the header are bit strings, and other parts are machine words.

So, in bitcoin, we have the network byte order, the local machine byte order, and the byte order that makes the hashes work out like everyone else's, and they are all potentially different.

Thanks for that, guys!

So you just concatenated all of those strings of text above theymos? In that order? Hashed them with sha256 and came up with that result?

Can I ask a question now..? WHY are we constantly changing endianness? Is it safer cryptographically or something?

Perhaps I did find the correct hash already, I just didn't think so because it didn't start with zeros :S

The numbers are little-endian and the hashes have their endianness reversed in relation to the hash endianness on Bitcoin Block Explorer.

Here's a block that I converted previously:


First hash is:
0cdb93c3412d2f30eb7d8dfd13d3142eaa8738c0de2337ac8a80c623715d9c07

Second hash is:
1195e67a7a6d0674bbd28ae096d602e1f038c8254b49dfe79d47000000000000

Reverse the endianness and you get:
http://blockexplorer.com/block/000000000000479de7df494b25c838f0e102d696e08ad2bb74066d7a7ae69511

  Looks like we are at the same stage of understanding bitcoin 

This sunday I am working on exactly the same issue. I found three aspects helpful:

1) The decription at https://en.bitcoin.it/wiki/Block_hashing_algorithm gives a rough idea

2) Reading the source of the satoshi implementation is...um...a good exercise in c++ fluency. However it is helpful for this question. The issue is: You have to get all the endian-nesses and all the sequences right. Satoshi implements an elaborate serialization concept and derives the has from there.

3) Probably the most helpful thing in this regards is the pastebin reference from (1) http://pastebin.com/n8UEGA86 It contains a c implementation of exactly the part you are looking into. I did not try it myself (but probably will do so eventually).

That said, let me make a general recommendation: Read the Satoshi implementation. It is not well documented, has a file structuring which is quite hard to read, uses boost library calls and has all kinds of twists and turns. However, it does pay off. Satoshi has numerous twists and turns and ideas and it takes a while to understand those. But it is not only every elegant (you can learn something about programming...)  -  it also contributes to the security and stability of the system.

I would recommend against php based implementations. And I would recommend against doing own implementations in bitcoin before you have completely digested the concepts in the Satoshi implementation. It took me 6 weeks of debug instrumentation, code commenting, code analysis and more - and as a result of this I ended up with this opinion.

Good luck.

I have managed to extract the following information from this pushpool solution:


What parts of that information (and in what order?) needs to be hashed by way of sha256 twice to come up with that block's hash?

I have checked out all of the data here: http://blockexplorer.com/testnet/rawblock/0000000000833b13e1d753f4b1d4d18e3a7bde2c2efb8deebaa0b868e3e4dcdf

The data I have found seems to be correct for the block in question, but how do I come up with the block hash from that information alone? Or is it even possible?

I am in the process of writing some php code that will create the current block hash from a block's header.

I am able to find the previous block hash by reversing endianness on the 64 characters after the first 8 characters in the block's header.

Do I have to do the same with the next 64 characters of the merkle root? Recombine everything and then hash it twice with sha256 to determine the current block's hash?

I am starting from a pushpool "solution".