log☇︎
3400+ entries in 0.413s
mod6: im not sure that i get this ^ but... i think we're all saying the same thing.
phf: ^
trinque: ^ I'm gonna spoil the shit out of this one. It ends with the chick learning the magic words SHE KNEW ALL ALONG because aliens fly their heptafold asses across the cosmos to make her the god-snowflake she is in her true self. This SO THAT humans can help teh alienz in 3000 years.
asciilifeform: ^ for the record. glibc retardation -- spreads.
asciilifeform: Framedragger: ^him
phf: ^
a111: Logged on 2016-12-23 14:07 mircea_popescu: http://btcbase.org/log/2016-12-21#1587182 << speaking of this, here's a question for the eager : a diophantine equation is a multivariate polynomial, something like ax+by^2 = 0. the question is : given an arbitrary finite set of known-good equations, can you use recursion to decide whether an arbitrary equation in the same variables is good (has integer solution) or no good ?
asciilifeform: ^ d00d worked for kgb crypto directorate in '80s, asked same question of his superiors, got same answer.
mircea_popescu: ^ recommended not just because of the 85 bitcents in prizes
asciilifeform: ben_vulpes, phf, et al ^
jurov: i was thinking we're in keyserver context, not ^ this
ben_vulpes: trinque: ^^
ben_vulpes: the naive o(n^2) calculation is to say "there is a signature for this patch" and not giving a shit about which signature, provided it corresponds to a key in .wot .
mircea_popescu: ^ from the history. check out what isn't a reliable source. epic shit.
mircea_popescu: ^epic schneider material though :D
Framedragger: ^ https://en.wikipedia.org/wiki/Alan_Conway
mircea_popescu: the correct margin is N^2
shinohai: ^ heh cock
phf: ^ http://data.whicdn.com/images/4863711/large.jpg
mircea_popescu: but the space gets pretty narrow. 3n, you shoot n^(1/2) messages you're suddenly losing
asciilifeform: BUT enemy knows that plaintext(first_half[0]) ^ plaintext(second_half[0]) == 'T'
mircea_popescu: if the message is n long, does the pad-machine tape need to be n^2 ?
mircea_popescu: individually. like the list could be x^2 = 4 ; x = 1 ; x ^ 3 + 5 = 6 - in which case your arbitrary equation may be a polynomial in x but not in x y
a111: Logged on 2016-12-23 14:07 mircea_popescu: http://btcbase.org/log/2016-12-21#1587182 << speaking of this, here's a question for the eager : a diophantine equation is a multivariate polynomial, something like ax+by^2 = 0. the question is : given an arbitrary finite set of known-good equations, can you use recursion to decide whether an arbitrary equation in the same variables is good (has integer solution) or no good ?
mircea_popescu: the reason is that same old mc^2 ; there's no better heat dampener than water nor better energy dampener than mass.
mod6: and when I do that above test ^, i never hit this line: death("Cyclic Graph!\n");
asciilifeform: ^ for the l0gz.
mircea_popescu: http://btcbase.org/log/2016-12-21#1587182 << speaking of this, here's a question for the eager : a diophantine equation is a multivariate polynomial, something like ax+by^2 = 0. the question is : given an arbitrary finite set of known-good equations, can you use recursion to decide whether an arbitrary equation in the same variables is good (has integer solution) or no good ? ☝︎☟︎☟︎
mircea_popescu: ^
asciilifeform: ^ this is seriously neato , ben_vulpes
a111: Logged on 2016-12-22 07:32 jurov: also, there is limit of 2^32 inodes, even in 64-bit mode
asciilifeform: http://btcbase.org/log/2016-12-22#1588254 << reiser doesn't use inodes, but iirc also limited to (2^32)-1 ~files~ ☝︎
a111: Logged on 2016-12-22 07:32 jurov: also, there is limit of 2^32 inodes, even in 64-bit mode
jurov: also, there is limit of 2^32 inodes, even in 64-bit mode ☟︎☟︎
BingoBoingo: ^ For herr vulpes
BingoBoingo: ^ Chuckle fodder
ben_vulpes: ^^
ben_vulpes: ^^
phf: ^ a regrind of http://btcbase.org/patches/funken_prikey_tools ?
phf: ^
ben_vulpes: and yes, this implies an o(n^2) worst case process in (or (map 'boolean (lambda (sig) (verify 'some_patch.vpatch' sig)))
asciilifeform: ^
mircea_popescu: for every patch, check if patch sig by approved names is present. this isn't any sort of N^2 ; it's O(N*M) where N is the count of patches and M the count of approved signers.
a111: Logged on 2016-01-18 15:35 ascii_butugychag: jurov: theoretically you can avoid using the name prior to .sig, but then you have to check ALL seals agains ALL patches ALWAYS and this is O(N^2)
a111: 21 results for "O(N^2)", http://btcbase.org/log-search?q=O%28N%5E2%29
asciilifeform: !#s O(N^2)
asciilifeform: iterating over patches is O(N^2) (unless the files are correctly named, patch.nickname.sig, which we do, but imho is a bit of a cheat)
trinque: asciilifeform: how did you ^ the first statement of it and waiwat the second
asciilifeform: ^
mircea_popescu: ^
asciilifeform: ^
pete_dushenski: ^also
pete_dushenski: ^japan's pm
asciilifeform: ^ 'official certification' of 'trng' of some poker derps, by some purported 'test lab', scrolled through to see what the submitted hardware was, and it... wasn't. it was a list of java src turds and their file hashes!
mircea_popescu: ^
asciilifeform: ^ obscure box with ssh on nonstandard port
asciilifeform: ^
asciilifeform: ^
a111: Logged on 2016-12-19 18:10 asciilifeform: using this ^ method, it was -- and remains -- possible to operate a useful node sans ethernet plug.
asciilifeform: using this ^ method, it was -- and remains -- possible to operate a useful node sans ethernet plug. ☟︎
asciilifeform: which is agonizingly O(N^2)
mircea_popescu: ^
Framedragger: ^ (not saying it's not a lost cause while working for one of those "tech" "leader" companies, in the way that applying adhesive to a bursting pipe is not fixing a water problem)
BingoBoingo: ^ Povertree is back!
mircea_popescu: Framedragger ^
phf: ^
asciilifeform: ^ folx who want to read, can read 'unofficial' here
mircea_popescu: ^ no indoor ~voice~ i mean above.
mircea_popescu: this is irl example, too. owning slaves = loads of fun, like kittens ^ akaname or somesuch.
asciilifeform: ^^
pete_dushenski: ^^
BingoBoingo: ^ From DEO Report on nuclear waste security
asciilifeform: ^
Framedragger: ^ true re latter, sure.
Framedragger: ^ digital ocean
Framedragger: ^ http://siphnos.mkj.lt/datadrop/crap-from-scans-to-be-sorted/
asciilifeform: ^ this is doomed to eventually happen
asciilifeform: ^ the d00d's work was 100% genuine, all of his leads checked out
thestringpuller: ^- meh https://www.youtube.com/watch?v=rX0ItVEVjHc not the best example cause he works on engines like ratchet and clank
a111: Logged on 2016-12-13 15:53 mircea_popescu: ^ that part gotta be in the logs.
mircea_popescu: ^ that part gotta be in the logs. ☟︎
a111: Logged on 2016-12-13 12:20 Framedragger: ^ just discovered this. "remove the CRUD", serve APIs directly from postgres. includes user/role/cookie management etc. pretty neat.
asciilifeform: ^ yes
asciilifeform: that one ^ beats 'doom', i can see.
Framedragger: ^ just discovered this. "remove the CRUD", serve APIs directly from postgres. includes user/role/cookie management etc. pretty neat. ☟︎
Framedragger: ^ ok, finally fixed. took forever. >.<
asciilifeform: ben_vulpes et al ^
asciilifeform: ^ worth keeping
asciilifeform: ^ did this ever work ?
asciilifeform: to verify a sig, you feed ptron this VALID PROGRAM ^ -- which creates the pubkey in memory -- and then on top of that, the sigogram
mircea_popescu: ^ phf did it correctly.
asciilifeform: jurov: ^ is what i did
jurov: ^ something iffy with mircea's base64
asciilifeform: ^
mircea_popescu: ^
mircea_popescu: ^
phf: trinque: ^
asciilifeform: i want : these ^ deedbotted.
asciilifeform: ^
mircea_popescu: ^