Cuckoo Cycle: A Memory Bound Graph-Theoretic Proof-of-Work.
John TrompPublished in: Financial Cryptography Workshops (2015)
Keyphrases
- graph theoretic
- graph theory
- upper bound
- lower bound
- memory usage
- maximum independent set
- random graphs
- memory requirements
- theorem prover
- worst case
- error bounds
- memory space
- graph properties
- hamiltonian path
- bayesian network structure learning
- associative memory
- main memory
- sample size
- search algorithm
- binary relations
- data structure
- genetic algorithm