asciilifeform: and will add, that it is theoretically possible to satisfy asciilifeform's uniformity criterion ( 'avoids no primes' + 'no bit of input is more influential over the output than any other bit' ) without creating the mythical n-th-prime-maker
asciilifeform: then again i didn't expect 'primes is in p' either.
asciilifeform: ( but not having it yet -- asciilifeform cannot say for a fact. )
asciilifeform: specifically that a proof of uniformity for an apeloyee-style primeconstructor mechanism, is in nearer reach than a runnable-on-2048b-ints aks.
asciilifeform: re prime gen -- i suspect that the problem can be finessed ,
asciilifeform: the sheer wtf, srsly, consider the folx who imagine they are somehow cryptoizing on a machine with no trng
asciilifeform: 'what if running on toaster, with no rng'
asciilifeform: i mean ffs, koch dun even leave a knob to get ~key~ entropy trngistically.
asciilifeform: 'can't pick witnesses trngistically because reasons'
asciilifeform: lol why not link obfuscatedccontest also
asciilifeform: ( can do ~120 on a4 if pressed. but leaves little margin room to write in )
asciilifeform: if your cut is substantially below 80, it is merely annoying and wasteful of vertical. however if ~above~ 80, it makes yer code unprintable without substantial rework
asciilifeform: so answer to mircea_popescu's q is, neither !