3 ms·
I also performed analysis of this algorithm as part of a work engagement, and came to similar conclusions to you (that it's not nearly as ASIC resistent as the
by q3k 6y ago
I also performed analysis of this algorithm as part of a work engagement, and came to similar conclusions to you (that it's not nearly as ASIC resistent as the authors claim).
Notably there was (and still somewhat is, but less so [1]) very low data dependency between the generated instructions, which enables ahead-of-time preprocessing on a CPU to get effective execution on a bunch of independent compute units / datapaths (on an FPGA/ASIC), saturating all of them during a significant amount of time.
[1] - https://github.com/tevador/RandomX/pull/118 https://github.com/tevador/RandomX/pull/118
- hyc_symas 6y agoSo I guess you're referring to section 4.2 in the X41 audit report https://github.com/hyc/RandomxAudits/blob/master/Report-X41-20190705.pdf https://github.com/hyc/RandomxAudits/blob/master/Report-X41-... We already responded to the points you raised. https://github.com/hyc/RandomxAudits/blob/master/Comment-X41.md https://github.com/hyc/RandomxAudits/blob/master/Comment-X41...