Timeline for What hash structure is Facebook Diem using?
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 11, 2022 at 17:13 | history | edited | David Jonsson | CC BY-SA 4.0 |
Correcting
|
| Jul 11, 2021 at 23:06 | comment | added | jjj | Actually the leading zeros are more of a side-effect. Mostly it's just that the hash value must be less than a specific value (like $2^{256}/difficulty$). Of course that results in the first digits beeing zero. (but allows for smoother steps) | |
| S Jul 5, 2021 at 16:01 | history | suggested | Ievgeni |
Delete a tag that seems unrelevent to me and add a new one.
|
|
| Jul 5, 2021 at 15:05 | comment | added | David Jonsson | @Ievgeni Yes this is what is commonly called proof-of-work. I am interested in general how proof-of-work limits the hash function. | |
| Jul 5, 2021 at 14:04 | answer | added | Ievgeni | timeline score: 1 | |
| Jul 5, 2021 at 13:49 | comment | added | David Jonsson | I wan't to know more about how secure it is. The more fixed values the less variation and less security in the algorithm. | |
| Jul 5, 2021 at 13:36 | comment | added | Ievgeni | Are you speaking about proof-of-work? | |
| Jul 5, 2021 at 13:35 | review | Suggested edits | |||
| S Jul 5, 2021 at 16:01 | |||||
| Jul 5, 2021 at 13:33 | history | asked | David Jonsson | CC BY-SA 4.0 |