Job
API should look something like this:
md.new(min: number?,max: number,seed: number?) -> sealed table--O(1)
md:map(x: number)->number--O(poly log), output and x are in min..max (inclusive)
md:imap(y: number)->number--O(poly log), output and y are in min..max, where r:imap(r:map(x))==x for all x in min..max
Maybe a Feistel cipher w/ super-logarithmic number of rounds is sPRP, but idk anything about cryptography.
Payment
Not sure
Contact
acreol#4609