Cuckoo Cycle: a graph-theoretic proof-of-work system

Abstract

We introduce the first graph-theoretic proof-of-work system, based on finding cycles in large random graphs. Such problems are arbitrarily scalable and trivially verifiable. Our implementation uses 1 bit per edge, and up to 1 bit per node. We hypothesize that using significantly less causes superlinear slowdown. 

Topics

Cite this paper

@inproceedings{Tromp2014CuckooCA, title={Cuckoo Cycle: a graph-theoretic proof-of-work system}, author={John W. Tromp}, year={2014} }