3 ms·
Pretty much any NP problem that we can't currently solve in polynomial time, ie. prime factorization - can be a PoW. I'm not sure which are specialized for GPU
by whimsicalism 3y ago
Pretty much any NP problem that we can't currently solve in polynomial time, ie. prime factorization - can be a PoW.
I'm not sure which are specialized for GPU-resistance, probably not prime factorization given it can be parallelized