log☇︎
61300+ entries in 0.44s
BingoBoingo: <asciilifeform> more of a case of finely evolved nose. we can smell it at nearly ppb. << Worst part of smoking cessation is having a sense of smell again. Still not sure it's worth it.
a111: Logged on 2017-06-27 00:57 asciilifeform: sina: one of the things gossipd needs is a constant-time-constant-space rsa. if you don't have one, enemy can derive your privkeys remotely based on timing.
mircea_popescu: http://btcbase.org/log/2017-06-27#1674687 << this is very much so, and very much why both a) http://btcbase.org/log/2017-06-17#1671529 and b) there not being an auto-signatron or decryptatron or so forth deployed anywhere in teh vast expanses of la serenissima. ☝︎☝︎☟︎
mircea_popescu: but hey, at least they get buggered sore like a hobo's whore. that + gallo pinto > what they got at home.
mircea_popescu lolzd at the whole shoe problem, because nicaragua has a healthy contingent of dumb white whores who went there to suck native cock and "get in touch with teh earth" paddling around barefoot in the streets and "learning" the "fascinating" how to twist a necklage together "antique traditional skills" sandy invented last decade.
mircea_popescu: http://btcbase.org/log/2017-06-26#1674638 <<< it's a good thing that the successful introduction of ipv6 rendered such considerations mute. ☝︎
a111: Logged on 2017-06-22 07:44 mircea_popescu: to satisfy http://btcbase.org/log/2017-06-20#1672531 -- try and fuck with btc price, discover eth "price" was a joke all along.
deedbot: http://www.contravex.com/2017/06/26/racing-for-a-cure-6-edmonton/ << » Contravex: A blog by Pete Dushenski - Racing for a Cure 6 – Edmonton
asciilifeform: ( for n00bs : 'hyperthreading' attemps to marshal 'resources unused by the current instruction' - say, the ALU during a memory fetch - into becoming, through sleight of hand, 'a cpu core' that is , while said resources are available, behaving as a cpu, executing instructions )
asciilifeform: http://btcbase.org/log/2017-06-27#1674906 << ht is not a legitimate concept, like, e.g., pipelining, but instead an ill-conceived attempt to speed up 'winblows as it existed at the time' ☝︎
a111: Logged on 2017-06-26 17:07 erlehmann: i am willing to abandon my redo efforts if v maketron suits my needs better. does there exist a v implementation in <500 lines of shell?
mircea_popescu: http://btcbase.org/log/2017-06-26#1674495 << it's a... haaaard....lyffe! ☝︎
a111: Logged on 2017-06-26 16:35 asciilifeform: 'Ever since IS&T started to undergo "The Transformation", there has been a deliberate and systematic attempt to change Computing at MIT for the worse. Services that have been relied on for years have been discontinued and turned down, frequently without notice. Infrastructure critical to running MIT has been outsourced to cloud services during "emergency maintenance". Most of these changes had minimal impact on students and faculty,
mircea_popescu: http://btcbase.org/log/2017-06-26#1674488 <<< for some reason the illustration featured a hercules, which is a prop not a jet, but w/e. ☝︎
a111: Logged on 2017-06-26 12:37 erlehmann: sina have you checked all your input against a formal grammar today?
mod6: i really like the new kb i've been using. took a little while to get use to, but hands feel good after all day typing.
asciilifeform: crapple kbd is egregiously, insidiously deadly, has ~0 'give', is rather like pounding a table
a111: Logged on 2017-06-26 05:39 ben_vulpes: on the "laptops suck" thread, now that i'm using an adult workstation most of the time, my hands start hurting after a bare thirty minutes on a 13" laptop kb
asciilifeform: 'a discovered peer' == 'a sybil'
a111: Logged on 2017-06-26 01:02 sina: but this presents a chicken/egg problem, where the peer "initiating" the addition will need to then advertise that key to the other peer and wait for a key back, and then initiate an update to the peer data to add in the advertised pubkey
mircea_popescu: http://btcbase.org/log/2017-06-26#1674379 << introductions aren't intended to be handled by gossipd. the correct way to do this is for me to say "add 8A56264EAD0BC4BD9CD7AC0086B488AB sina" which is a legitimate pubkey of your gossipd, AND for you to go whatever re mine. then they can talk, change keys etc. not before./ ☝︎☟︎
asciilifeform: more of a case of finely evolved nose. we can smell it at nearly ppb.
asciilifeform: shit where-they-stood a la africa ?
a111: Logged on 2017-06-25 22:30 erlehmann: BingoBoingo medusa magazine seems pretty reasonable, indeed https://medusamagazine.com/youre-a-bigot-if-you-wouldnt-have-sex-with-a-gay-friend
mircea_popescu: http://btcbase.org/log/2017-06-25#1674362 << speaking of bigots : so i'm walking with girl through utter shithole, true poverty area. stench of sewage in the air, houses made out of $200 in materials and so on. i spot a rabid dog by that sure sign of drooping salivation, so i go in between and keep my eye on it. ☝︎
sina: alrighty, gonna go do some human stuff. have a good week all!
mircea_popescu: after a fashion!
sina: vulnerable to what, exactly, is the question? I am struggling to see how timing can be ascertained from that kind of model, but it's only a thought experiment so I can steal your brain juices
asciilifeform: 2) you might have a box with 2+ cpu where the scheduler puts both of your processes on 1
asciilifeform: 1 ) you might have a box with 1 cpu
asciilifeform: on a pc
sina: messages are to be delivered for a given peer or set of peers.
asciilifeform: sina: making 'constant time rsa' by trying to bury the rsa in a fixed 'box' of time, only works if you can guarantee LOWER bound of how long the rsa ops (ALL of them, till the end of time) take, as well as UPPER
asciilifeform: certainly not on a pc.
asciilifeform: now i know that a certain % of the time your 'box' is spilled out of.
sina: asciilifeform: how about this simpler model. Nodes only accept connections at interval N seconds, and during time between intervals it is preparing encrypted payload of all messages since last seen for each peer. so when A connects to B and says "Hi, I'm A", B responds with a pre-prepared payload encrypted for As key
sina: asciilifeform: don't pop a vein, I absolutely get your point, I was trying to explain (erroneous or otherwise) the path walked
a111: Logged on 2016-02-08 00:06 mircea_popescu: the only assurance to be had here comes from a gossipd model. where anyone could have written the plaintext, and for all anyone POORLY CONNECTED knows, they probably did.
asciilifeform: no, it'd be a nickserv, sina
asciilifeform: wtf is the point of writing a proggy that leads to this.
asciilifeform: sina: yes. and it is not a far assumption, nobody will send plaintext wtf omfg
asciilifeform: if this is a surprise to you -- i recommend getting familiar with the basic arithmetic
sina: so no key is ever retained beyond a single "session"
sina: why would there be a long term key? I mean, right now in the impl the process to rotate a key is manual, but if you're using ephemeral key why not just "chain" them in the sense that at the end of the "session" you pass some ciphertext that includes the next ephemeral key, wait for delivery ack and then dump the old key?
sina: another thought, in my impl, even if you broke the key, all this nets you is the ability to have messages delivered to you from a single node
a111: Logged on 2017-06-17 19:56 asciilifeform: idea of pll is that you can indeed see a lit match from mile away in daylight if you know 'exactly when to look'
asciilifeform: sina: this is a good q
sina: asciilifeform: if I'm not pestering let me throw a couple of questions. in my impl there are two secret operations, 1. key generation 2. challenge decryption. for #1, it runs in a different process on a random basis and marks a portion of the keys generated as bogus (per linked spec). that seems like it should sufficiently obfuscate against timing? for #2 is it possible to do some bogus ops in a similar
asciilifeform: ( this should not horrify, but encourage. the logs are a very handy resource. )
asciilifeform: sina: if you've been reading anything other than the logs, you have a great deal of catching up to do.
asciilifeform: sina: if some % of the time i can determine how long it took you to carry out a secret key op (incl. key generation) i can determine a few bits of key. over time, i get 1/4 of them, and that is == to getting the rest.
mod6: everytime I think of a shoemaker/cobbler, i think of that character from A Tale Of Two Cities who used to be a Doctor before he did 18 years in the Bastille.
sina: asciilifeform: can you elaborate on timing? in my impl each peer-pair has its own set of corresponding RSA keys and I was thinking of adding something like, at the end of each session a new keypair is generated and exchanged on each side
asciilifeform: sina: one of the things gossipd needs is a constant-time-constant-space rsa. if you don't have one, enemy can derive your privkeys remotely based on timing. ☟︎
sina: I honestly didn't make it because I thought it would solve any problem, but only because I saw the spec and happen to be on holidays from work this week, thought it would be a good fun
asciilifeform: sina: at least a few folx were playing with very similar things even before mircea_popescu wrote his essay
trinque: one's even a hideous bashball
asciilifeform: phf has a very similar gossipd in commonlisp, for instance ☟︎
a111: Logged on 2017-06-26 16:32 asciilifeform: http://btcbase.org/log/2017-06-26#1674428 << fwiw i carefully read all of it. asciilifeform's verdict: very much a gabriel_laddel-ization of gossipd. does 0 of the necessary work, and drags in 5+GB of liquishit deps (python, sql, some derp's crypto lib.) the amount of this that would have to be rewritten, from the ground, is 100%. not even useful as illustration of anything, because NONE of the actually complicated moving parts of a
asciilifeform: 'if yer making shoes, you oughta be a shoemaker'
mod6: yah, if you want !b, gotta make them yourself, or hire a sandal artisan of sorts.
asciilifeform: because a) can't be arsed to go to town to get new one b) ain't like you can get nonchinese sandal anyway
asciilifeform: epoxying, i shit thee not, a paid of shoes
asciilifeform: https://archive.is/7bx0V << upstream in same thread << apparently he tried to draw a line, 'stfu with the monolithic unreadable patches'
shinohai: Plus another fine DDoS https://etherscan.io/txsPending?a=0x331d077518216c07c87f4f18ba64cd384c411f84
shinohai: Apparently they made a "Mobile ethereum interface w/ encrypted messaging"
ben_vulpes: > sold via OTC over the course of the next month, to ensure it will have a negligible effect on the market
asciilifeform: gotta luvv the folx so slow on the uptake, who imagine being in 'a community' while having already been subsumed into usg faceless mass.
phf: "[Global Notice] Hi all. We need to take services (NickServ, ChanServ and friends down for some quick database tweaking so they'll be unavailable for a few minutes. I'll update via WALLOPS when completed."
asciilifeform: and the necessary bits -- reduce to a slightly generalized vtron.
asciilifeform: which SHOULD NOT BE A THING
asciilifeform: gnudiff, i found, in fact DID misbehave, on many a box
asciilifeform: ( what's a 'misproblem' ? let's say it is a problem that only exists because of misapplied concepts earlier 'up the stack' . see also the immortal prof. kokkarinen's 'alien problem', http://btcbase.org/log/2014-11-26#934852 thread . ) ☝︎
asciilifeform: immutable past is a prerequisite to ~authenticable~ past, and v gives it.
asciilifeform: nope. outputs of presses to a given node on the flow - will NEVER change.
asciilifeform: want change ? that'll be a new patch, and 1 or more new sigs.
erlehmann: how would you structure it? programmatically, it does not matter if there are 3 videos or 30000, a “partial build” just converts the ones that need converting and uploading.
asciilifeform: what's that got to do with whether a maketron ought to be able to do partial builds ?
erlehmann: a bot i wrote, that travels PubMed Central open access publications, takes supplementary materials, fixes common errors in metadata, converts the files to other formats and uploads them.
erlehmann: most of those are audio or video files. every format conversion is a build
erlehmann: so redo turns the process on its head: build is atomic, but redo only claims to have a tree when all is built.
erlehmann: the point of redo vs. make is that make does the same: build tree, walk tree. the problem is that this may need in a second treewalking phase and a third etc. pp. until the build becomes stable
asciilifeform: erlehmann: or at least read ben_vulpes's classic article re subj, http://cascadianhacker.com/07_v-tronics-101-a-gentle-introduction-to-the-most-serene-republic-of-bitcoins-cryptographically-backed-version-control-system
erlehmann: asciilifeform there might be one detail why it is possible to make a v maketron, but no v redotron. does v try to work out all dependencies before processing?
erlehmann: actually, ++++ is a valid base64 input
asciilifeform: erlehmann: the +++ thing was actually a more serious problem than you might walk away thinking on first reading -- because it is physically impossible to fix it without MAKING NEWLINES SIGNIFICANT semantically
asciilifeform: which is a problem.
erlehmann: well, epigraph has a preamble that parses input http://news.dieweltistgarnichtso.net/bin/epigraph
asciilifeform: erlehmann: that looks a lot like my original vdiff.
erlehmann: i have a single phone with no bourne shell and two others that have it.
erlehmann: i chose bourne shell specifically because redo runs everywhere and i consider it stupid to need a C++ compiler or python interpreter for building stuff.
erlehmann: i am willing to abandon my redo efforts if v maketron suits my needs better. does there exist a v implementation in <500 lines of shell? ☟︎
asciilifeform: in general, the tumour mass of 'i have 200 utils that do ~same thing on my box, and not a single one ~quite~ works entirely' is to be flamethrowered.
asciilifeform: one - proper one - suffices. and it is easier to produce from a generalized vtron, than to produce a vtron from, e.g., 'redo'.
asciilifeform: erlehmann: it isn't clear to me that these belong in separate programs, and that a system ought to have two tree walkers.
erlehmann: apart from separation of concerns (tree-walking vs. invoked programs), what other gains are to be had by using a hypothetical v maketron instead of the existing redo maketron?
asciilifeform: ( so long as the signers, sign the hashes, and you still have a cryptographically healthy frozen history -- it is entirely acceptable to specify also how the inputs are to be produced. )
asciilifeform: and they'd trigger, if hash not found immediately. and so you get a maketron.
asciilifeform: thing is, nowhere is it written that a v program ~must~ be a gnudiff-like thing
erlehmann: so v is more like a reverse epigraph, in my understanding