Timeline for Why was finding a hash beginning with a certain number of zeroes chosen as the proof of work?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 19, 2015 at 3:18 | vote | accept | Ali | ||
| Nov 15, 2015 at 2:28 | comment | added | Nick ODell | @Ali It can't be any 256 bit number (there's a format it needs to follow, see here) but you can use very nearly any value. | |
| Nov 15, 2015 at 1:34 | comment | added | Ali | Is the target number a power of two, or can it be any 256-bit number? | |
| Nov 14, 2015 at 22:21 | answer | added | Pieter Wuille | timeline score: 7 | |
| Nov 14, 2015 at 22:19 | comment | added | Pieter Wuille | It doesn't check for a number of zero bits. It checks whether the hash, when interpreted as a 256-bit number, is lower than a target number. That target number is occasionally adjusted. | |
| Nov 14, 2015 at 21:45 | review | First posts | |||
| Nov 16, 2015 at 12:02 | |||||
| Nov 14, 2015 at 21:40 | history | asked | Ali | CC BY-SA 3.0 |