Hi!
I'm using Shake256 in a setting where all input data is known at compile-time, a case where the hash value could be computed at compile-time too.
I've been using tiny-keccak before (I'm not sure why anymore, exactly), and I started toying with it to support const fn hashing. I've bounced on some hurdles, which is why I made that issue.
This week I realized I could probably start the same discussion here: how painful would const fn-hashing be to implement? I feel like it would probably not work due to the Digest family of traits (trait fns cannot be const afaik), but I'd nevertheless would want to discuss!
Best regards,
Ruben
Hi!
I'm using
Shake256in a setting where all input data is known at compile-time, a case where the hash value could be computed at compile-time too.I've been using
tiny-keccakbefore (I'm not sure why anymore, exactly), and I started toying with it to supportconst fnhashing. I've bounced on some hurdles, which is why I made that issue.This week I realized I could probably start the same discussion here: how painful would
const fn-hashing be to implement? I feel like it would probably not work due to theDigestfamily of traits (traitfns cannot beconstafaik), but I'd nevertheless would want to discuss!Best regards,
Ruben