Re: [Bitcoin-development] Anyone still using SOCKS4?

2014-07-04 Thread Wladimir
On Wed, Jun 11, 2014 at 5:39 PM, Wladimir laa...@gmail.com wrote: If no one screams fire, we plan on removing support for it in the next major release, for two reasons: - It would remove some crufty, hardly tested code paths - SOCKS5 offers better privacy as it allows DNS redirection

Re: [Bitcoin-development] Anyone still using SOCKS4?

2014-07-04 Thread Drak
*watches the tumble weed blow by* I think it's pretty safe to remove it... On 4 July 2014 08:15, Wladimir laa...@gmail.com wrote: On Wed, Jun 11, 2014 at 5:39 PM, Wladimir laa...@gmail.com wrote: If no one screams fire, we plan on removing support for it in the next major release, for

[Bitcoin-development] ASIC-proof mining

2014-07-04 Thread Andy Parkins
Hello, I had a thought after reading Mike Hearn's blog about it being impossible to have an ASIC-proof proof of work algorithm. Perhaps I'm being dim, but I thought I'd mention my thought anyway. It strikes me that he's right that it's impossible for any algorithm to exist that can't be

Re: [Bitcoin-development] ASIC-proof mining

2014-07-04 Thread Alan Reiner
Just a thought on this -- I'm not saying this is a good idea or a bad idea, because I have spent about zero time thinking about it, but something did come to mind as I read this. Reading 20 GB of data for every hash might be a bit excessive. And as the blockchain grows, it will become infeasible

Re: [Bitcoin-development] ASIC-proof mining

2014-07-04 Thread Andy Parkins
On Friday 04 July 2014 06:53:47 Alan Reiner wrote: ROMix works by taking N sequential hashes and storing the results into a single N*32 byte lookup table. So if N is 1,000,000, you are going to compute 1,000,000 and store the results into 32,000,000 sequential bytes of RAM. Then you are

Re: [Bitcoin-development] ASIC-proof mining

2014-07-04 Thread Alan Reiner
On 07/04/2014 07:15 AM, Andy Parkins wrote: On Friday 04 July 2014 06:53:47 Alan Reiner wrote: ROMix works by taking N sequential hashes and storing the results into a single N*32 byte lookup table. So if N is 1,000,000, you are going to compute 1,000,000 and store the results into

Re: [Bitcoin-development] ASIC-proof mining

2014-07-04 Thread Andy Parkins
On Friday 04 July 2014 07:22:19 Alan Reiner wrote: I think you misundersood using ROMix-like algorithm, each hash I did. Sorry. requires a different 32 MB of the blockchain. Uniformly distributed throughout the blockchain, and no way to predict which 32 MB until you have actually

Re: [Bitcoin-development] ASIC-proof mining

2014-07-04 Thread Gregory Maxwell
On Fri, Jul 4, 2014 at 3:27 AM, Andy Parkins andypark...@gmail.com wrote: Hello, I had a thought after reading Mike Hearn's blog about it being impossible to have an ASIC-proof proof of work algorithm. Perhaps I'm being dim, but I thought I'd mention my thought anyway. Thanks for sharing.