3 ms·

i imagine n+1 is much faster than generating a large random number for each hash. They probably generate a guid and then append a number and increment Whats t

i imagine n+1 is much faster than generating a large random number for each hash. They probably generate a guid and then append a number and increment Whats the advantage of using a new random number each time?

wmf 13y ago
Fun EE fact: An LFSR is cheaper than a counter.
- joezydeco 13y ago
  But an LFSR only gives you a pseudorandom result, right? I mean, I'd rather load thermal noise than use a shift.
  - wmf 13y ago
    For searching a 32-bit nonce space I'd rather use a PRNG than a true RNG to avoid wasting work due to birthday paradox collisions.