1. 5
    A memory-bound graph-theoretic proof-of-work system cryptocurrencies distributed math github.com
    readevalprint avatar via readevalprint 3 months ago | cached | 2 comments

  1.  

  2. 3
    lithp avatar lithp edited 3 months ago | link

    I love the idea of giving out bounties to anyone who can speed up the miners.

    If you’ve found a speed-up it makes far more sense to claim the bounty now than to hope nobody else notices before a public chain launches and becomes valuable.

    1. 2
      lithp avatar lithp 3 months ago | link

      I read the whitepaper last night, it’s worrying that SipHash is being used in this way. A second-preimage attack against SipHash could help speed up the low-memory algorithm and SipHash wasn’t explicitly designed to be secure against those when the secret key is known.

      Zooko says it better than I can:

      One detail that bothers me is that SipHash is being used in Cuckoo PoW in a way that the attacker gets to control all the inputs to SipHash, and that is not what SipHash was designed to resist. SipHash was designed to resist an attacker who doesn’t control — and actually doesn’t even know — the key. There’s a possibility (although it seems unlikely to me) that an attacker could exploit something about the way Cuckoo uses SipHash to find Cuckoo solutions faster than by treating SipHash as a random oracle.