log☇︎
24000+ entries in 0.004s
asciilifeform: specifically in re 'iron built for reliability', 'tandem' was interesting. i dun expect to ever lay hands on 1 , tho
asciilifeform: lotsa ancient artifacts are imho worth documenting. tricky bit is getting at the surviving crumbs.
asciilifeform: e.g. xerox lispm is rarer still ( and had own merits, which i pieced together 100% from docs and surviving photos and won't even go into in depth because approx as questionable as archaeology of merv... )
asciilifeform: mircea_popescu: believe or not, bolix aint even the least-gettable old/interesting comp
asciilifeform: ( see also e.g. http://btcbase.org/log/2017-05-23#1660268 ) ☝︎
asciilifeform: in exactly same way that 'no reported thefts of gold from ft.knox' can mean 1 of 2 things.
asciilifeform: ( and not necessarily the 1 implied by commenter.. )
asciilifeform: http://btcbase.org/log/2018-12-14#1880808 << on 2nd thought, 'no reported breaches' could mean 1 of 2 things ! ☝︎
asciilifeform: verily
asciilifeform: mircea_popescu: according to commenter, nsa killed.
asciilifeform: or moar litrage, anyway
asciilifeform: ( see e.g. eltsin )
asciilifeform: worx 100% , just takes moarwork
asciilifeform: i gotta take to drink, so i can quit!11
asciilifeform: apparently quitting drink, does do ~sumthing~
asciilifeform: ( can laff if you like, at the d00d, but he ~does~ apparently have a blog. and it's even 1 that aint in 'lamp stack' , and i envy the pg load latencies.. )
asciilifeform: in other lulz ( and given as http://logs.bvulpes.com/asciilifeform still dead.. ) , http://p.bvulpes.com/pastes/iLAh3/?raw=true << recent proceedings from asciilifeform's outpatient tele-clinic .
asciilifeform: ( from backlink lint trap )
asciilifeform: els and VMM’s still have code injections and leaks the 1990’s versions prevented. Recent example being cache-based, side channels originally reported in 1992 in VAX VMM using analysis method from 1991.' )
asciilifeform: meanwhile, for pro entomologists only, https://archive.is/UFTWQ ( e.g. 'Some like SNS Server have no reported breaches over almost 30 years. Companies wouldn’t buy them. FOSS folks don’t build them. To this day and uniquely to this sub-field, most folks well-known in security act like none of that work ever happened, ignore those methods that got results, and slowly reinvent them or knockoffs of them with less results. Their kern
asciilifeform bbl,teatime
asciilifeform: aha
asciilifeform: yea strike that. ( asciilifeform mistaken in >1 way, it is also possible for '9000' legit clients to issue hello and overfill , even if it were actually the case that 1:1 handshake )
asciilifeform: hm
asciilifeform: sect. 6.4
asciilifeform: linked snip
asciilifeform: mircea_popescu, diana_coman: re queues filling : per my reading of http://trilema.com/2018/euloras-communication-protocol-restated/#selection-673.0-673.234 , well-behaved clients cannot cause queue to overfill, as it's a synchronous back/forth. so overfilled queue indicates somebody for the chopping block.
asciilifeform: ty
asciilifeform: diana_coman: 2nd link in post (to asciilifeform's www) malformed
asciilifeform: mircea_popescu: from my reading, diana_coman will have same proggy on 2 boxen, but routine-a runs on box a, and routine-b on b
asciilifeform: why wouldja have an empty queue (unless no traffic) ..?
asciilifeform: + priorityqueues dun have O(1) insertion.
asciilifeform: ( item can be made as mircea_popescu described, either from 2 fifos or 1 priorityqueue. but the latter is actually much moar complicated, in re moving parts, than the former )
asciilifeform: so then 2 queues lol
asciilifeform: what happens is that nothing behind the 22 rsa items is eaten until they are. as one'd expect from an ordinary fifo. hence asciilifeform's nitpick.
asciilifeform: diana_coman seems to have an ordinary queue.
asciilifeform: ( 'priority queue', i believe. but from my brief look at diana_coman's posted item, it dun do this )
asciilifeform: can do it, but the resulting data structure called sumthingelse.
asciilifeform: that aint called a queue, normally
asciilifeform: mircea_popescu: a 'queue' in the usual sense doesn't have a 'pick an X', it has 'pick from top'
asciilifeform: ok makes sense
asciilifeform: aa
asciilifeform: mircea_popescu: how wouldja, e.g., 'these 6 cpus for serpent, these 3 -- for rsa' if yer packets are in 1 queue ?
asciilifeform: )
asciilifeform: ( i thought orig mircea_popescu spec was 'keep rsa packets in own queue, so clearly cap the resource that is spent on'em'
asciilifeform: hm ?
asciilifeform: you'd want'em in separate queues, neh? whole point of marking the packets distinguishable by size
asciilifeform: ( ffa is not threaded per se, but is thread-safe, dun allocate anyffing other than on stack, i.e. can be used inside a thread safely )
asciilifeform quite fond of the ada thread model, it's prolly closest one can get to sanity on pc irons
asciilifeform: diana_coman's udp tester was threaded
asciilifeform: mircea_popescu: sorta the philosophy i went with in FG -- redundancy against iron-death error oughta live upstack ( i.e. you plug in >1 ) rather than inside box
asciilifeform: correct, udp quite analogous to, say, radio, you can send but no promises that anyone heard
asciilifeform: if only thing that can kill the socket is killed iron, retrying it won't bring back to life will it.
asciilifeform: and yes death is the correct behaviour.
asciilifeform: it's like the fg serial socket.
asciilifeform: ( see if this holds , for various scenarios, yank cord, yank nic )
asciilifeform: diana_coman: my current understanding is that the socket won't ever close, if iron is intact.
asciilifeform: it eats a packet and then tries to send , afaik the os will not report a eggog on send() unless there in fact are no working nics
asciilifeform: mircea_popescu: there ain't a 'connection' in udpology
asciilifeform: diana_coman: have you managed to achieve the socket-closing eggog without directly abusing the lib ? (e.g. by trying to send oversized packet, etc)
asciilifeform: ( iirc nothing happens, udp dun guarantee delivery, lol )
asciilifeform: diana_coman: see what happens when nic cord yank
asciilifeform: ( unlike e.g. tcp, where pipe can die )
asciilifeform: it's like fg, the only failure mode is magic smoke release
asciilifeform: i can think of only 1, dead irons
asciilifeform: diana_coman: under what condition wouldja get udp lib barf ?
asciilifeform: diana_coman: what sorta errors ? packet is either legit or not, neh
asciilifeform: mircea_popescu phrased it correctly earlier, point is to remove from ip stack the job of queueing
asciilifeform: ( rather than per-user )
asciilifeform: mircea_popescu: 1 thread for tx, 1 for rx
asciilifeform: ( asciilifeform's item defo not adult grade, however )
asciilifeform: so imho a++
asciilifeform: mircea_popescu: threaded worker 'rescuing from nic' into queue, and threaded eaters eating from same, is how asciilifeform baked prototype gossip thing from which udplib taken
asciilifeform: (i.e. added to the kicklist, which rejects packet in O(n log N) where N is number of idjits )
asciilifeform: diana_coman: can send, but then he's a spammer, not client, and gets kicked
asciilifeform: so server cannot be 'swamped'
asciilifeform: mircea_popescu: in re 'synchronous', it is my understanding that client is not permitted to send a packet unless the n-1'st has been ack'd
asciilifeform: i.e. if client's cord gets pulled, from his pov he will stall, from server's , his character is standing still, and when plugs back in, will live again
asciilifeform: diana_coman: per my current understanding of mircea_popescu's protocol, it is immune to packet loss (i.e. client will retry)
asciilifeform: mircea_popescu: i thought your orig queue was specifically re clog (impedance mismatch) in the unix ip stack
asciilifeform: mircea_popescu: even on hypothetical box with 9000 cpus, still no 'clogs', all you get is that the sender waits on the nic. queue cannot overflow cuz your protocol is synchronous ( server dun send anyffing to client unless asked )
asciilifeform: ( i.e. without the variant packet widths . instantiate one with rsa-width buffer, and 1 w/ serp.width )
asciilifeform: mircea_popescu: if you have 2 sockets, can even use orig variant of udptron.
asciilifeform: it dun make sense, in that light, 'clog' -- all that happens if waiting on nic, is that the sender thread empties its queue slower.
asciilifeform: therefore the call to it won't return until the packet has left the house
asciilifeform: recall also that your udp sender is blocking
asciilifeform: no 'clog'
asciilifeform: diana_coman: you're cpu bound ( serpent ) so you likely will never hit the bandwidth bound. so the udpgrams will go in ~realtime.
asciilifeform: unix is retarded : limits total # of open sockets. so having >1 not only imposes overhead without achieving anyffing, but will eventually hit ceiling.
asciilifeform: imho not.
asciilifeform: you dun need a socket per client in udpism
asciilifeform: mircea_popescu, diana_coman : you have 1 thread, that monopolizes socket, and fetches from a semaphoric queue ( diana_coman posted such a queue today ). other threads can put whatever on queue, and sender sends.
asciilifeform: 1 socket can send whatever one likes
asciilifeform: mircea_popescu: with diana_coman's variant of my udp routine, you dun need >1 socket to send
asciilifeform: mircea_popescu: iirc diana_coman wrote one 3wk ago
asciilifeform: yea subj is tapped out till i get the box in hands
asciilifeform: ( witness, 2 yrs of FG and no 'chinese copy' )
asciilifeform: mircea_popescu: presently can't think of any reason not to put whole effort, chunk by chunk, on www
asciilifeform: so folx can 'you wouldn't download a car!111' 'fuck you, would if i could' (tm)
asciilifeform: tricky bit is to turn thing from 'martian artifact' back into bits.