>>5737434I didn't believe this at first, then again... can you, really? Calculating 2^256 is trivial, incrementing a variable (one that won't overflow, too) 2^256 times is not - I assume that's what the guy meant by 'counting'.
A naive implementation in Lisp I've just done can do about 2^27 / sec, that's 10^61 years to do 2^256. Assuming you have a great hand-crafted assembly implementation and an amazing rig, you can probably bring it down to 10^55 or so.
