Is there an algorithm that requires very little memory to verify a nonce but without cons mentioned in https://www.cs.cmu.edu/~dga/crypto/cuckoo/analysis.pdf?