sina: suggestions on the following key exchange conundrum:
sina: I am trying to program the following behaviour, a user can run "gossipc --add-peer --host 1.1.1.1 --port 5000 --name sina" and gossipc will select one of the available (not bogus) RSA keys generated by the ongoing key generation process and say something like "peer added. advertise/exchange the following pubkey to that peer:"
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
☟︎ sina: which seems a bit hacky.
sina: any thoughts? does that even make sense? basically it's caused because I am trying to use a different pubkey per peer, if there was just 1 pubkey it would be a standard out of band RSA pubkey exchange
sina: or should it be a three-phase thing where 1. each peer advertises their name/host/port to the other 2. each receives the others pubkey 3. adds it to the peer info
sina: that seems less hacky typing it out
BingoBoingo: Gay Pride Marchers Carrying Star of David Flags Kicked Out of Chicago Parade
BingoBoingo: ISRAELJERUSALEMGAYPARADE An Israeli woman draped with a rainbow gay pride flag with the Star of David walks past Israeli border policemen during the annual Jerusalem Gay Pride Parade on July 21, 2016.
BingoBoingo: Three people carrying Jewish Pride flags were asked to leave the Chicago Dyke March on Saturday in part because they repeatedly expressed support for Zionism"
sina: TL;DR, Russian gay activist who triggered crackdown/kidnap/murder on gay people in Chechnya (aside from a bunch of other stupid shit) is also very anti-semite
sina: it's almost as if being a homosexual has nothing to do with your political orientation :P
jhvh1: BingoBoingo: Bitstamp BTCUSD last: 2532.21, vol: 10188.40615120 | BTC-E BTCUSD last: 2537.006, vol: 5061.79062 | Bitfinex BTCUSD last: 2488.5, vol: 16447.74479774 | BTCChina BTCUSD last: 2880.064726, vol: 8307.21190000 | Kraken BTCUSD last: 2498.81, vol: 5140.30973793 | Volume-weighted last average: 2577.0287227
ben_vulpes: not to piss in cheerios, but to find shared basis.
ben_vulpes:
http://btcbase.org/log/2017-06-22#1673500 << most folks who bitch in the manner of "oh noes, rising rents and stagnant wages" have not meaningfully pursued higher wages. not a matter of "rich as know how to get" but "thought this rich was enough forever" which is very foolish.
☝︎ a111: Logged on 2017-06-22 19:48 asciilifeform:
http://btcbase.org/log/2017-06-22#1673487 << i find it lulzy that folx will happily say this to someone to whom they would ~not~ necessarily say 'kill yerself nao, slice lengthwise' . but at the same time the phrases have EQUIVALENT meaning, because at some point you are already as rich as you possibly know how to become.
a111: Logged on 2017-06-25 16:07 mp-en-managua: ah, ben_vulpes' thingee dun read outloud huh. also the windows original product keys are a little lengthy.
a111: Logged on 2016-03-01 03:53 asciilifeform: mats: the idea is, a kind of line-speed (GB ethernet) wall, where crud goes in, and valid in-wot gossipd out.
sina: ben_vulpes: that is quite different from the spec :P
sina: ben_vulpes: I'm not smart enough to make what's described there, just implementing the spec I saw for amusement
a111: Logged on 2017-06-25 06:30 BingoBoingo: ben_vulpes: Felt that. The thing is gotta learn the more mundane feelings to learn the novel ones
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
☟︎ BingoBoingo: Or as an alternative there's a number of new manufacter 2-cycle scooters which do not require registration due to various "moped" exemptions. Needs to be under 50cc displacement which means riding machine with 1/4 of a lawnmower engine or twice a string trimmer engine.
sina: alright. the gossipd thingo is 0.0.1 implemented. peers can communicate, each session (fetch messages) is mediated by deedbot style OTP with per peer-pair RSA keys (no GPG shell asciilifeform, using libtomcrypt). I wrote a tiny client to add peers, exchange keys, broadcast msgs and view stored msgs. there is a README.
sina: it's still a little rough around the edges so you can break it pretty easily if you disconnect during a session or send bad data or whatever like that.
☟︎ sina: pytomcrypt is the only external dependency
sina: tmsr trigger warnings: it uses sqlite, TCP, OOP but I tried to make it modular enough that those things could easily be changed. It isn't the lighthouse or linespeed thing asciilifeform has mentioned, I just tried to follow the spec on trilema.com
sina: TL;DR: unfixed Skylake and Kaby Lake processors could, in some
sina: situations, dangerously misbehave when hyper-threading is enabled.
☟︎ sina: Disable hyper-threading immediately in BIOS/UEFI to work around the
sina: problem. Read this advisory for instructions about an Intel-provided
erlehmann: sina have you checked all your input against a formal grammar today?
☟︎ a111: Logged on 2017-06-26 09:59 sina: it's still a little rough around the edges so you can break it pretty easily if you disconnect during a session or send bad data or whatever like that.
sina: erlehmann: nope hehe
sina: erlehmann: yup. if you look through the code you see I do validate inputs as they come in on the socket for example, but I noticed while I was developing that there are some more subtle edge cases and that's what I was referring to
sina: I was just happy to get the OTP working for today and will continue to increment it
sina: erlehmann: I do hope to be able to code a naughty host counter up, still thinking about that
sina: I was just about to sign off for the night :)
sina: hope you have a nice day
mod6: how goes shinohai ?
shinohai: Not bad mod6 .... want to get with you later this evening on the new Makefiles thing if you have a few minutes to spare
erlehmann: shinohai faster smaller and more reliable than make
shinohai likes anything that can be done better w/ shell scripting
erlehmann: if your build-system is not recording two dozen dependency relationship for a simple hello world program, it is pretty much a non-build-system
erlehmann: reading the text explains that statement
shinohai: Hey the redo-dot dep graph thing is pretty nifty too!
erlehmann: i have yet to see a build system that can do so much in so few lines of code
erlehmann: it has cmake scripts and a makefile
erlehmann: but the cmake scripts don't work well
erlehmann: and the makefile only builds the project on every second invocation
BingoBoingo: In not news, Buttstamp now introduce Litecoin trading to two cans and a string too
mod6: <+shinohai> Not bad mod6 .... want to get with you later this evening on the new Makefiles thing if you have a few minutes to spare << sure thing. did you get to try it out?
shinohai: Haven't gotten to try it yet, but want to run the full suite of tests as soon as I get back home this afternoon. ;)
mod6: ok, np. there are a matrix of tests that can be extrapolated from the doc.
mod6: we can discuss later though.
shinohai: kk, will ping you when I get back - sorry for the pm tag this weekend :/
trinque: didn't a (temporarily) flying one catch fire the other week?
trinque: clearly needs to upgrade to the f35, it's 19 better.
☟︎ TomServo: asciilifeform: Tis what I was (obliquely) referencing with the 'moar'
mod6: <+shinohai> kk, will ping you when I get back - sorry for the pm tag this weekend :/ << no worries at all
a111: Logged on 2017-06-26 15:30 erlehmann: > Makefiles
a111: Logged on 2017-06-26 12:16 sina: situations, dangerously misbehave when hyper-threading is enabled.
erlehmann: asciilifeform i am curious, how does v walk dependencies and non-existence dependencies related to files?
erlehmann: i was of the impression that it presses a specific view of the world out of a) source code b) patches c) wot
erlehmann: so v is more like a reverse epigraph, in my understanding
erlehmann: non-existence dependencies are leaf nodes, so tree-walking stops there
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?
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?
☟︎ 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 have a single phone with no bourne shell and two others that have it.
erlehmann: but that's my need. i was scratching my own itch.
erlehmann: same problem domain, simple problem, DON'T TASE ME BRO
erlehmann: thinking about the grammar of vpatches made me come here
a111: Logged on 2016-12-11 18:53 asciilifeform: so i had two base64's png files in there,
erlehmann: well, full recognition before processing.
erlehmann: the part from “while read dt source tr _;” on is solely to prevent bad stuff happening
erlehmann: asciilifeform thanks for giving an example regarding +++
erlehmann: actually, ++++ is a valid base64 input
a111: Logged on 2014-10-29 01:36 asciilifeform: because plain ascii is like naked people
erlehmann: ; printf '++++' | base64 -d | od -t x1
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: 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
erlehmann: think of TeX requiring at least three compiles until layout becomes stable
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: current number of files that OAMI converted and uploaded to wikimedia commons stands at 35646
erlehmann: most of those are audio or video files. every format conversion is a build
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: well, full rebuilds are infeasible, in terms of time and computing power resources i have available
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.
erlehmann: okay, but then one of the converted ones changes.
erlehmann: yet outputs can change based on e.g. newly introduced inputs
erlehmann: do you have an opionion on GNU tsort?
a111: Logged on 2014-11-26 01:11 asciilifeform: reminds of ilkka kokkarinen's 'alien problems':
erlehmann: i guess with immutable inputs, redo would not be necessary.
☟︎ BingoBoingo: <asciilifeform> they spent it all on... ethertardium?! << YES!!!
shinohai: Dat nearly 20% drop of ETH in 24 hrs >.>
☟︎ a111: Logged on 2017-06-26 17:41 erlehmann: i guess with immutable inputs, redo would not be necessary.
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."
ben_vulpes: > sold via OTC over the course of the next month, to ensure it will have a negligible effect on the market
shinohai: Just another Lame Ethereum ICO that raised millions and now gonna dump to pay for hookers, etc.
shinohai: Apparently they made a "Mobile ethereum interface w/ encrypted messaging"
phf: nah, that's your monthly occurrence.
☟︎