Exploiting Time-Memory Tradeoffs in Cuckoo Cycle
نویسنده
چکیده
Cuckoo Cycle is a recently proposed “memory-hard” computational Proof-of-Work (PoW) function designed to require a minimum amount of memory to compute efficiently. This paper describes two algorithms that use the sparsity of the Cuckoo Cycle graph to use less memory than both the initially hypothesized and updated proposed bounds for this proof-of-work function. The second algorithm presents a near-linear time/memory tradeoff for the most computationally intensive part of solving the Cuckoo Cycle proofof-work function.
منابع مشابه
History-Independent Cuckoo Hashing
Cuckoo hashing is an efficient and practical dynamic dictionary. It provides expected amortized constant update time, worst case constant lookup time, and good memory utilization. Various experiments demonstrated that cuckoo hashing is highly suitable for modern computer architectures and distributed settings, and offers significant improvements compared to other schemes. In this work we constr...
متن کاملCuckoo Cycle: a memory-hard proof-of-work system
We introduce the first trivially verifiable, scalable, memory-hard and tmto-hard proof-of-work system.
متن کاملEnergy Efficiency and Reliability in Underwater Wireless Sensor Networks Using Cuckoo Optimizer Algorithm
Energy efficiency and reliability are widely understood to be one of the dominant considerations for Underwater Wireless Sensor Networks (UWSNs). In this paper, in order to maintain energy efficiency and reliability in a UWSN, Cuckoo Optimization Algorithm (COA) is adopted that is a combination of three techniques of geo-routing, multi-path routing, and Duty-Cycle mechanism. In the proposed alg...
متن کاملWear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket
We study wear-leveling techniques for cuckoo hashing, showing that it is possible to achieve a memory wear bound of log logn + O(1) after the insertion of n items into a table of sizeCn for a suitable constantC using cuckoo hashing. Moreover, we study our cuckoo hashing method empirically, showing that it significantly improves on the memory wear performance for classic cuckoo hashing and linea...
متن کاملChunkStash: Speeding Up Inline Storage Deduplication Using Flash Memory
Storage deduplication has received recent interest in the research community. In scenarios where the backup process has to complete within short time windows, inline deduplication can help to achieve higher backup throughput. In such systems, the method of identifying duplicate data, using disk-based indexes on chunk hashes, can create throughput bottlenecks due to disk I/Os involved in index l...
متن کامل