For some problems, there is a choice of how to organize its data structures. One that requires random access, and another that is mostly sequential access. The

For some problems, there is a choice of how to organize its data structures. One that requires random access, and another that is mostly sequential access. The latter might take an order of magnitude more space, while still being faster. An example of such a problem is the Cuckoo Cycle Proof-of-Work [1]. [1] https://github.com/tromp/cuckoo https://github.com/tromp/cuckoo