Hacker News new | ask | show | jobs
by freemint 1486 days ago
> how much faster would it be at SAT solving?

With modern SAT solvers or with historic (single threaded) SAT solvers?

1 comments

Now that I think of it, maybe I should have given Argon2 hashing instead of SAT as an example.

Argon2 hashing is designed to benefit as little as possible from parallel GPU computations.

Why would you want to do that? What are you even trying to measure?
A measure of speed of running general purpose code, including compiling, operating systems, GUI's, rendering websites, running electron applications, database queries, ... to get an idea of when we can see the 1000x speedup super computers got, to daily applications