Just as an aside to this lengthy convo, the Cryptonote-based BCN recently
had some interesting updates which made it easier for ordinary computers
(nothing special) to handle it.
I realize that's not Bitcoin, but I thought I'd throw it out there.
Thanks Mike.
Indeed, I am aware of current
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
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
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
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
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.
6 matches
Mail list logo
