Difference between revisions of "Equihash"

From CryptoLUX
Jump to: navigation, search
Line 3: Line 3:
{| class="floatright"
{| class="floatright"
| [[File:Sparx-A.png|thumb|SPECKEY, denoted A<sub>k</sub>.]] || [[File:Sparx-64-round-function.png|thumb|Round function of SPARX-64/128]]
| [[File:Equihash-pic.pdf|thumb|Equihash overview.]] ||

Revision as of 16:03, 15 October 2016

Equihash is a memory-hard proof-of-work scheme. It solves a computational puzzle, best algorithms for which require certain computational and memory resources.


High Level View

  • Article: "Equihash: asymmetric proof-of-work based on the Generalized Birthday problem[1]
  • Authors: Alex Biryukov and Dmitry Khovratovich

Equihash is a family of proof-of-work schemes with three parameters n, k, and d, which determine the scheme Equihash-n/k/d and the time and memory complexity of the puzzle solver for it, and seed S, which makes every puzzle unique and solutions incompatible. The best algorithms for Equihash-n/k/d require O(2n/(k+1)+d) time and O(2n/(k+1)) memory, though implementations of this algorithms differ in both metrics, see below.

The puzzle for Equihash-n/k/d is to find i1, i2, ..., i2k



Here, we list several Equihash instances with d=0, and provide time and memory requirements of our reference implementation. We also provide lower bounds on the memory requirements such that any ASIC implementation using less memory should incur a significant penalty

n,k Time Memory Minimum memory
144,5 15 sec 2 GB 500 MB
200,9 5 sec


  • NDSS'16 paper: To appear
  • Eprint version: To appear
  • Bibtex entry: To appear
  • Presentation slides:
  • Reference implementation:
  • Optimized implementations: .


  1. Biryukov, A. and Khovratovich, D. (2016). Equihash: asymmetric proof-of-work based on the Generalized Birthday problem. In Network and Distributed System Security Symposium (NDSS) 2016.