Quote from: Denni on April 15, 2014, 01:36:35 PM

Quote from: tromp on April 15, 2014, 12:56:02 PM

Quote from: Denni on April 15, 2014, 11:20:13 AM

Quote from: tromp on April 14, 2014, 05:58:47 PM

I'll stick with CryptoNight vs Cuckoo Cycle, assuming a size 2^{32} for the latter
memory 2MB 4GB
memoy-hardness solid can run twice as slow in 3GB, or 50% faster in 6GB
hardness hypothesized; not provable
parallellizable not at least 20+ threads (probably less than 100)
access pattern random random
latency low (cache) high (main memory)
verification slow instant
%computation probably > 90% 33%
%memory probably < 10% 67%

Can you explain what latency means in this particular case? I mean I know it's some kind of delay between something but what stands for "something" here?

Latency is the time between the start of a memory access instruction, and it's end,
when the value has been retrieved, and is available for use.

And from your numbers I assume that cache is much faster compared to main memory?

Yes; cache is at least an order of magnitude faster than main memory.

Note that CryptoNight also does a lot more computation per random memory access
(AES encryption) than Cuckoo Cycle (siphash-2-4), further contributing to its high
computational load.