log☇︎
13 entries in 0.655s
asciilifeform: http://btcbase.org/log/2017-11-13#1737245 << if you apply the bound we found in http://btcbase.org/log/2017-07-06#1679483 thread, and the http://btcbase.org/log/2017-08-15#1698509 trick, mphf a not-especially-slow hash ☝︎☝︎☝︎
asciilifeform also entertained that this is almost the exact arg of mircea_popescu an' asciilifeform re mphf, originally, but with the sides reversed
asciilifeform: of course, arguably if you can actually DO this, you will probably lose interest in the mphf method per se
asciilifeform: was more of a philosophical observation : that mphf is not turing-complete ( in the same way 'p' is not. deliberately )
asciilifeform: ~after~ a mphf (or similar) hash is taken, the time and space required are known.
asciilifeform: mircea_popescu: mphf in a fixedtime fixedspace system is insane
a111: 5 results for "MPHF", http://btcbase.org/log-search?q=MPHF
asciilifeform: !#s MPHF
bitesak: mphf?
jurov: tiberiusiv: there's mircea's private activities like MPHF
mircea_popescu: http://polimedia.us/bitcoin/mphf.txt
mircea_popescu: polimedia.us/bitcoin/mphf.txt
mircea_popescu: polimedia.us/bitcoin/mphf.txt you can read it there.