--- Log opened Tue Feb 25 00:00:05 2020 00:33 -!- jonatack [~jon@2a01:e0a:53c:a200:bb54:3be5:c3d0:9ce5] has joined #bitmetas 01:01 -!- jonatack [~jon@2a01:e0a:53c:a200:bb54:3be5:c3d0:9ce5] has quit [Ping timeout: 272 seconds] 01:56 -!- jonatack [~jon@2a01:e0a:53c:a200:bb54:3be5:c3d0:9ce5] has joined #bitmetas 02:37 < real_or_random> hmmm. Idk. it would be good to support 0 bytes at least 02:38 < real_or_random> anything between 0 and 32 is kind of arbitrary. I mean it's good that our algorithm works for any size but I'm not sure if we should explciity allow it in the BIP 11:57 -!- jonatack [~jon@2a01:e0a:53c:a200:bb54:3be5:c3d0:9ce5] has quit [Ping timeout: 252 seconds] 12:03 < nickler> one way to get around it is to make every test vector 32 or 0 byte randomness, add a test vector for 8 byte randomness and skip that test vector in libsecp 12:06 < sipa> exactly 32 bytes makes sense, actually 12:06 < sipa> just pad with zeroes if you have less 12:06 < sipa> the hashing means that should be fine 12:21 < nickler> agree --- Log closed Wed Feb 26 00:00:06 2020