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

feat: update sha2-asm dependency version #1457

Merged
merged 2 commits into from
May 6, 2021
Merged

feat: update sha2-asm dependency version #1457

merged 2 commits into from
May 6, 2021

Conversation

cryptonemo
Copy link
Collaborator

fix: update call based on updated version

fix: update call based on updated version
@@ -81,7 +81,7 @@ impl Implementation {
for block in blocks.chunks(2) {
buffer[..32].copy_from_slice(&block[0]);
buffer[32..].copy_from_slice(&block[1]);
sha2_asm::compress256(state, &buffer);
sha2_asm::compress256(state, &vec![buffer]);
Copy link
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

@dignifiedquire What's the better non-allocating way to do this?

Copy link
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Hah! Nevermind, clippy for the win

Copy link
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Also, I thought that's what I first tried, but apparently not ...

@cryptonemo cryptonemo merged commit 32eed31 into master May 6, 2021
@cryptonemo cryptonemo deleted the sha2-updates branch May 6, 2021 16:30
neithanmo pushed a commit to Zondax/rust-fil-proofs that referenced this pull request Jun 9, 2021
* feat: update sha2-asm dependency version
* fix: update call based on updated version
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 this pull request may close these issues.

2 participants