rich1.0npub1sm6zhjmk5scuz294jmpkw99wwwjzetjgwp4fu4gn6utqgdz87hkqamnq7hhttps://nostr.ae/npub1sm6zhjmk5scuz294jmpkw99wwwjzetjgwp4fu4gn6utqgdz87hkqamnq7hnjumphttps://nostr.ae📅 Original date posted:2014-07-04 📝 Original message: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 32,000,000 sequential bytes >> of RAM. Then you are going to do 1,000,000 lookup operations on that >> table, using the hash of the previous lookup result, to determine the >> location of next lookup (within that 32,000,000 bytes). Assuming a >> strong hash function, this means its impossible to know in advance what >> needs to be available in RAM to lookup, and it's easiest if you simply >> hold all 32,000,000 bytes in RAM. > My idea wasn't to make hashing memory hungry; it was to make it IO-hungry. It > wouldn't be too hard to make an ASIC with 32MB of RAM. Especially if it > gained you a 1000x advantage over the other miners. It seems that sort of > solution is exactly the one that Mike Hearn was warning against in his blog. I think you misundersood.... using ROMix-like algorithm, each hash 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 executed it. If the difficulty is high enough, your miner is likely to end up going through the entire X GB blockchain while searching for a good hash, but other nodes will only need to do 32 MB worth of disk accesses to verify your answer (and it will be unknown which 32 MB until they do the 1,000,000 hash+lookup operations on their X GB blockchain). I think that strikes a good compromise of needing access to 100% of the blockchain, without requiring reading 20 GB to verify a block. (Replace N=1,000,000, 32 MB and 20 GB with the appropriately calibrated numbers in the future)