 |
March 02, 2015, 06:26:54 PM |
|
I've got a pretty good idea of how the hashing actually woks although I have difficulty wrapping my head around the compression.
From what I've gathered, the data is split into suitable chunks and then hashed. If its less then ideal, it becomes padded although I doubt Bitcoin hashing requires it.
The Avalon data sheets point to a method of sorts for preprocessing where the data is split up outside the chip before being sent to it.
I also remember TheRealSteve telling me that a difference exists between typical SHA256 and the Merkle-Damgard construct...or Merkle Tree, if my vernacular is correct.
|
