|
|
|
|
|
|
by tromp
1753 days ago
|
|
|
A good PoW should have very fast verification. That's why scrypt makes a poor choice of PoW (technically, the hashcash PoW with scrypt as hash function). It's quite possible to have an instantly verifiable memory hard PoW, where only finding solution takes lots of memory, while verification takes none. For example, Cuckoo Cycle and its variants [1]. [1] https://github.com/tromp/cuckoo |
|
|