4 ms·

Given a sequence of N hashes, you could select any hash A as the initial hash, any hash B as the key, and the successor of B (C) as the key to the key. After c

Given a sequence of N hashes, you could select any hash A as the initial hash, any hash B as the key, and the successor of B (C) as the key to the key. After choosing B and C, choose an A whose distance to B and C is proportional to the amount of work you wish to require.

simias 13y ago
Your "given a sequence of N hashes" is a bit of a deus ex machina here :)
- zeckalpha 13y ago
  Create it using 50% of your lifetime. Or create one for your children.