quickcheck VS BLAKE3

Maybe https://github.com/BurntSushi/quickcheck too?

Yeah as other have mentioned, I was using Rust before 1.0.

This is my first public commit: https://github.com/BurntSushi/quickcheck/commit/c9eb2884d6a6...

I didn't write any substantive Rust before that point. So I'm at over 9 years.

The book, Zero To Production In Rust, uses quickcheck:

Hi all! I'm looking for some feedback on my latest crate, reltester. It's a small utility crate that, when paired with property-based testing with e.g. quickcheck makes it very easy to check that your handwritten comparison trait implementations satisfy the necessary constraints (transitivity, reflexivity, and all that stuff). I wrote it our of frustration after finding many subtle bugs in our PartialEq and PartialOrd implementations at $JOB, and hopefully someone else will find it useful.

For what it's worth this would also be a good candidate for property based testing, like with: https://github.com/BurntSushi/quickcheck

I'm aware of Hypothesis and its approach, but the connection between Hypothesis and arbitrary is indeed non-obvious. Even looking over the API docs again, the most I could pick up was this on the docs of Unstructured:

Quickcheck https://github.com/BurntSushi/quickcheck

I'm running into a strange issue while using [quickcheck](https://github.com/BurntSushi/quickcheck) to implement tests and I'm hoping someone here might have an idea. Long story short, I have tests which fail in weird ways when using quickcheck that I can't reproduce otherwise, so I'm not even sure if it's a legitimate issue or not.

> might be easier with a public domain license instead of the current ones

There reference implementation is public domain (CC0) or at your choice Apache 2.0

https://github.com/BLAKE3-team/BLAKE3/blob/master/LICENSE

Fyi, blake3 was released in 2019 and should probably be used over blake2 unless you have some strong reason not to. It's basically a reimplementation of blake2 with performance tweaks.

https://github.com/BLAKE3-team/BLAKE3

Many people will argue that today's compilers are so smart/optimized that you'd be a fool to try to outsmart the compiler with asm. I'm not 1 of them, but I know some. IMO it's all a bunch of bullshit, there's a goddamn reason all the cryptocurrency mining CPU/GPU code is all hand-written asm. there's a reason blake3 is written in asm ( https://github.com/BLAKE3-team/BLAKE3/blob/master/c/blake3_sse41_x86-64_windows_msvc.asm ) - but the thing is, 99.99% of the time, life is too short to outsmart the compiler (unless you're Alexander Yee)

I have been trying to optimize my code to create a fast hashing function to create and check b3 file integrity but b3sum is way way faster than my aproach, i have been trying to modify my code acordingly to https://github.com/BLAKE3-team/BLAKE3/blob/master/b3sum/src/main.rs with no luck, so if anyone can give me some tips/clues on how to achieve better speeds it would be incredible. Thx!!

BLAKE3 might be faster than KangarooTwelve and is also an XOF. It doesn't have the benefit of getting a working RFC draft proposal however.

You're saying the hash speed is 133 kB/s? That's extremely slow, for example BLAKE3 achieves 6.8 GB/s which is over 50000 times faster. Nobody wants to use such a slow hash function.

Try this one if you want a smaller, and particularly interesting crate: https://github.com/BLAKE3-team/BLAKE3

blake3 is a cryptographic hashing function, which is used during plotting's "forward propagation" step

BLAKE3 claims to be faster and more secure than both MD5 and SHA1.

More information: https://github.com/BLAKE3-team/BLAKE3