[hashcash] Re: Sample code for Dworkian memory-bound POW

  • From: "Eric S. Johansson" <esj@xxxxxxxxxx>
  • To: hashcash@xxxxxxxxxxxxx
  • Date: Mon, 24 May 2004 07:47:25 -0400

Anonymous wrote:

> /* mempow.c
>  *
>  * Memory based proof of work

thank you anonymous.  Now we need to figure out if there's any IP 

proof of work puzzles are all about transistors.  The number of 
transistors you can use for computation and storage.
Dworkian puzzles can be thought of as hashcash whose storage 
requirements exceed the size of today's cache.  As soon as you can put 
enough memory on to the cache, memory bound POW loses its advantage.

another question is can the MB POW be solved faster if you shrink its 
memory requirements and put it into cash (i.e. a spammer cheat)

all in all, it's a problem worth looking at


Other related posts: