Hacker News new | past | comments | ask | show | jobs | submit login

Thanks, that's basically what I was looking for. I have apps that are bottlenecked by blake2, so finding a faster cryptographic hash function would be pretty interesting to me.



If BLAKE2 (I assume you're using blake2b) is your bottleneck, perhaps you should consider the blake2bp (four way parallelism) or the blake2sp (eight way parallelism) variants. If even those are too slow for you (lots of continuous data and you have multiple cores available), then you might be able to try using tree hashing on top of one of the mentioned BLAKE2 variants.

I'm curious though, what are you working on that saturates ~1 GiB/s/core?


A content addressable distributed cache, where the disk + network IO capacity is ~40Gb/s. A bit similar to IPFS.


Interesting. How big do you need the hashes to be?




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: