On Mon, May 18, 2020 at 1:01 PM wrote:
>
> When a cell with a small effort in the queue has any chance of getting
> selected, the optimal strategy for a legitimate client would be to
> compute nonces and send as many nonces as possible until it causes
> congestion on his network. Instead when onl
I've been working on a custom PoW algorithm specifically for this
proposal. It is 10x faster to verify than RandomX-Tor and doesn't
require any memory for verification.
Full write-up is here: https://github.com/tevador/equix/blob/master/devlog.md
Especially the comparison table in the Appendix ma
