<tusko> "what is it that fundamentally..." <- Random reads/writes over huge swathes of uncached memory, a large variety of types of instructions including floating arithmetic, etc

<jeffro256[m]> "Random reads/writes over huge..." <- Lot of memory, complex instructions, need I/O. Can we objectively say that RandomX is designed to be most inefficient and annoying hash function ? or is this statement wrong in some sense ?