Author: Tim Ruffing 2017-04-19 11:08:15
Published on: 2017-04-19T11:08:15+00:00
In an email thread, Natanael has discussed the idea of proving optimal implementation for hash functions. While it is a good idea in theory, it seems impossible to prove currently. Additionally, he suggests that internal state reuse should be avoided through measures such as "whitening" and pre-hashing, which would prevent ASICBOOST type optimizations. A slower hash function or iterating the hash function multiple times could also be used for practical purposes. PoW verification will still be fast enough, and memory-hard functions are currently the best option for PoW functions.
Updated on: 2023-06-12T00:29:53.880731+00:00