Bitcoin Forum
January 22, 2021, 01:50:23 PM *
News: Latest Bitcoin Core release: 0.21.0 [Torrent]
   Home   Help Search Login Register More  
Pages: [1]
Author Topic: Cuckoo Cycle: a memory-hard proof-of-work  (Read 865 times)
Hero Member
Offline Offline

Activity: 706
Merit: 593

View Profile
February 06, 2014, 03:02:36 AM
Last edit: February 06, 2014, 03:24:46 AM by tromp

(re-announcing since paper has been substantially improved, and the implementation changed hash function)

Cuckoo Cycle is the first proof of work that does little computation but lots of random accesses to RAM,
making it both CPU and power friendly.

Proofs, of size 42*4=168 byes, are trivially verifiable, using only 1/3 KB.

It can be made to require any desired amount of RAM, e.g. 4GB, which is 32x more than what fits on an ASIC,
and which will send nearly all botnet computers into swap-hell, alerting their owners.

A whitepaper and implementation is available at
Pages: [1]
Jump to:  

Powered by MySQL Powered by PHP Powered by SMF 1.1.19 | SMF © 2006-2009, Simple Machines Valid XHTML 1.0! Valid CSS!