Re: Bitcoin challenge transaction: ~100 BTC total bounty to solvers!
I'm trying with the Pollard Kangaroo script. Let's see how much it'll take 
Isn't it inaccurate for higher bit counts?
[bits] 2^62 (warn: too big!)
It's also very slow, at least for lower bits (3+ hours to crack 50 bits). BSGS cracked 50 bits in 94 seconds, but it needs exponentially growing amounts of memory.
I don't have the BSGS script, so I'm trying some other codes.
