Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Add details BLAKE-256 hash function page #947

Closed
s-ben opened this issue May 22, 2019 · 14 comments · Fixed by #1034
Closed

Add details BLAKE-256 hash function page #947

s-ben opened this issue May 22, 2019 · 14 comments · Fixed by #1034
Assignees

Comments

@s-ben
Copy link
Contributor

s-ben commented May 22, 2019

"Why BLAKE-256?" is a common enough question that @davecgh has written a nice comprehensive answer to this question on reddit. This answer could be worked into the blake-256-hash-function page with minimal editing.

@0xmzz
Copy link
Member

0xmzz commented May 23, 2019

Nice find, I was trying to spruce up the blake-256 page in issue 878 but did not find good enough resource nor did I have enough subject matter expertise. This info can definitely be added, I feel, pending @davecgh input.

@s-ben
Copy link
Contributor Author

s-ben commented May 23, 2019

I got this reddit post from @davecgh when we were chatting about how to reuse technical content from reddit actually. So I think this is a solid resource. Want to take a stab at incorporating?

@0xmzz
Copy link
Member

0xmzz commented May 23, 2019

Don't want to take work you have scoped, but if your plate is full I can take a stab.

@s-ben
Copy link
Contributor Author

s-ben commented May 23, 2019

Left up for a few days in case anyone else wanted it :) Could do myself, but my plate is fulleth right now.

@0xmzz
Copy link
Member

0xmzz commented May 23, 2019

Will take it on then

@0xmzz
Copy link
Member

0xmzz commented Jun 20, 2019

This fell through the cracks as June has been a packed month for me. Will be getting to this end of the month.

@s-ben
Copy link
Contributor Author

s-ben commented Jul 5, 2019

Some inspiration for you @zubairzia0 :)

image

@0xmzz
Copy link
Member

0xmzz commented Jul 6, 2019

Haha, saw that and it did inspire me :) . I've worked on the page a bit and had to do alot of background research aswell, should have something in a few days.

@0xmzz
Copy link
Member

0xmzz commented Jul 19, 2019

@s-ben
Copy link
Contributor Author

s-ben commented Sep 6, 2019

Hey @zubairzia0, this draft is looking pretty good. Definitely a lot more info that we currently have. Thoughts on just porting some of this to the BLAKE-256 page?

@0xmzz
Copy link
Member

0xmzz commented Sep 7, 2019

Hey @s-ben, have a version locally that is a bit more presentable but I need to put a few hours more hours of work to fix it up. Getting there slowly but surely.

@s-ben
Copy link
Contributor Author

s-ben commented Sep 20, 2019

You're probably aware of this already, but found this nugget on BLAKE-256 in some notes @raedah provided for the dev docs. Thought I'd pass along just in case.

(from chat on 2019-03-28)

There is only a single round of blake256 hashing required in Decred versus 2 in sha256 because blake does not have the vulnerabilities that require the double hashing. Then there is the fact that the Decred header provides ample nonce space so it's not necessary to completely recalculate the merkle root every 2^32 nonces (which an ASIC blows through in a few microseconds). The combined result is that it takes much less energy to find a solution for a given hash rate.

@0xmzz
Copy link
Member

0xmzz commented Sep 21, 2019

You're probably aware of this already, but found this nugget on BLAKE-256 in some notes @raedah provided for the dev docs. Thought I'd pass along just in case.

(from chat on 2019-03-28)

There is only a single round of blake256 hashing required in Decred versus 2 in sha256 because blake does not have the vulnerabilities that require the double hashing. Then there is the fact that the Decred header provides ample nonce space so it's not necessary to completely recalculate the merkle root every 2^32 nonces (which an ASIC blows through in a few microseconds). The combined result is that it takes much less energy to find a solution for a given hash rate.

I was not sure about that actually, thank you for clearing that up. Now I can include that fact. Thank you @s-ben

@0xmzz
Copy link
Member

0xmzz commented Dec 14, 2019

It took a while but finally had more time this month to spend on this and get it done. Please have a look and let me know any feedback.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging a pull request may close this issue.

2 participants