Show Idle (>14 d.) Chans

← 2022-05-31 | 2022-06-02 →
vex: seriously, maths prof with a big telescope. #metoo must mean something different where the trees spew maple syrup
vex: pls to change the topic verisimilitude
vex: have you got reading problems?
verisimilitude: Yes; I occasionally go days without reading my books, but I'm improving.
vex: I consider you to be as honest as the day is long
vex: the wileys isn't commnesurate with the fuckery tho
vex: get wrenching
vex: not ven pete dushenski has pop up headfligts. only shinohai
vex: sup nigger
crtdaydreams: !!v 02CCB6031C60CFA7C99E7EE21155E3D4C8DE40AB3FC0FDC2F1311E29A3F4A6AE
deedbot: crtdaydreams rated verisimilitude -1 << shit stirrer: e.g., occasional meaningful insights drowned out by tendency to "miss the memo", can't bring up a conversation about programming without a shameless plug to his website --, imageboard moderator.
dulapbot: Logged on 2022-05-31 18:08:58 verisimilitude: Well, I was being purposefully provocative, so I suppose I deserved this reaction.
billymg: << this was actually the next thing i was going to try, i'm reading up on it now and it looks like it might be the right solution. the downside is that the weight of the table will increase, because it requires a separate field to store the tokenized version of the payload (and the additional index on that field)
bitbot: Logged on 2022-05-31 19:33:46 signpost: tried the built-in full-text search?
billymg: << this could work too but would mean redoing results pagination, which currently comes for free via sql limit/offset
bitbot: Logged on 2022-05-31 19:33:06 asciilifeform: shinohai: might be cleaner & faster to simply run ordinary py regex over the results which come back from the current search
asciilifeform: billymg: indeed it would
verisimilitude: The dulapbot shouldn't've responded to the deedbot.
asciilifeform: verisimilitude: atm it dun have billymg's patch against this
asciilifeform: !q uptime
dulapbot: asciilifeform: time since my last reconnect : 350d 14h 47m
verisimilitude: Alright.
verisimilitude: Say, I just noticed my WWW browser maybe uses UDP internally for events, as it may drop, reorder, or duplicate them.
asciilifeform: verisimilitude: events?
verisimilitude: It's a joke. I can tell Firefox to refresh a page, and move to another page, and it refreshes both.
verisimilitude: This happened earlier, which completed the joke.
verisimilitude: Previously, I was accustomed to dropping and reordering, but not duplication.
whaack: !w poll
watchglass: Polling 15 nodes...
watchglass: : ( Alive: (0.022s) V=70001 (/ Jumpers=0x1 (TRB-Compat.) Blocks=738907
watchglass: : ( Alive: (0.021s) V=99999 (/ Jumpers=0x1 (TRB-Compat.) Return Addr= Blocks=738907
watchglass: : Alive: (0.081s) V=99999 (/ Jumpers=0x1 (TRB-Compat.) Return Addr= Blocks=738907
watchglass: : ( Alive: (0.112s) V=99999 (/ Jumpers=0x1 (TRB-Compat.) Blocks=738907
watchglass: : Alive: (0.144s) V=99999 (/ Jumpers=0x1 (TRB-Compat.) Blocks=738907 (Operator: asciilifeform)
watchglass: : Alive: (0.083s) V=99999 (/ Jumpers=0x1 (TRB-Compat.) Return Addr= Blocks=738907 (Operator: whaack)
watchglass: : Alive: (0.143s) V=99999 (/ Jumpers=0x1 (TRB-Compat.) Blocks=738907
watchglass: : ( Alive: (0.327s) V=88888 (/ Jumpers=0x1 (TRB-Compat.) Blocks=738907
watchglass: : ( Alive: (0.306s) V=99999 (/ Jumpers=0x1 (TRB-Compat.) Blocks=738907
watchglass: : ( Alive: (0.388s) V=99999 (/ Jumpers=0x1 (TRB-Compat.) Blocks=738907
watchglass: : Could not connect!
watchglass: : ( Alive: (0.660s) V=99999 (/ Jumpers=0x1 (TRB-Compat.) Blocks=738907
watchglass: : Alive: (0.425s) V=99999 (/ Jumpers=0x1 (TRB-Compat.) Return Addr= Blocks=681481 (Operator: whaack)
whaack: NZ node finally sync'd sometime between today and May 17th
watchglass: : Busy? (No answer in 100 sec.) (Operator: asciilifeform)
watchglass: : Busy? (No answer in 100 sec.)
shinohai: wb whaack
asciilifeform: mats: next, 'allow sun to rise' ?
asciilifeform: wb whaack !
dulapbot: Logged on 2022-03-28 16:19:58 signpost: figures there oughta be a few folks here that can afford to go on a small hardware adventure sometime around 2024, assuming north america isn't covered in radioactive cobalt by then.
mats: there's a scene in 'a connecticut yankee in king arthurs court' where the protagonist stays his own execution by knowing the moment of a solar eclipse
verisimilitude: I find it paramount that port dispatch should be constant time.
verisimilitude: My first thought was a table of addresses or whatever, but I've gone from there.
verisimilitude: If control over the exact addresses be unneeded, and it is unneeded, then a simple mapping function could be used instead.
verisimilitude: Say we use memory organized into pages.
verisimilitude: It's trivial to map ports to pages, then, and, while plenty of services would need but one page, it's not a perfect solution.
asciilifeform: mats: indeed there is
asciilifeform: verisimilitude: what means 'port dispatch' in this context?
verisimilitude: So, the first part of every page could list its suitability, its minor mappings, and other useful information, to be dispatched by a different execution unit independently.
verisimilitude: Well, DNS is 53, HTTP is 80, Gopher is 70, and so on.
verisimilitude: The default dispatching would either ignore packets, or log something about them.
asciilifeform: verisimilitude: aa. how wouldja 'in constant time' tho if the # of entries in table can change ?
verisimilitude: Using pages, this could be achieved by ``page misses'' or whatever.
asciilifeform: nuffin constanttime about those, tho
verisimilitude: List every entry, asciilifeform.
asciilifeform: verisimilitude: right, is elementary to 'is x in table t in constant time', simply walk all of t. but if # of entries in t may change , thenwat
verisimilitude: That would be an issue with the scheme, then.
verisimilitude: No, I'll explain.
verisimilitude: There are 65,536 ports, so have 65,536 entries.
verisimilitude: If pagination poses problems, have a table of bits for this before the mapping function.
asciilifeform: a but any kinda optimization will make for variable time
verisimilitude: I'm imagining the hardware receiving a packet, and dispatching by the port number. It finds the page, reads it, sets up the scratch page or pages the first page describes, and then letting it run alone.
verisimilitude: A lot of little services would need no scratch beyond the ability to compose a response packet and log, so those could be treated specially.
asciilifeform: verisimilitude: most ip stacks already have array of 2**16 entries, afaik, for this
verisimilitude: That's good.
asciilifeform: how didja think it worked
asciilifeform: pile of if-thens? lol
verisimilitude: I figured some of them probably used binary trees.
asciilifeform suspects it'd be -ev on anyffin resembling modern irons
asciilifeform: branching -- expensive
verisimilitude: Of course, but since when do they make good decisions?
asciilifeform dun have the cycles atm to survey traditional ip stacks and see how; invites verisimilitude to do it if he feels like
verisimilitude: I'd rather not.
verisimilitude: Still, this is a nice little design compared to ``register service and wait for OS to drop packets in mouth''.
verisimilitude: A network system should primarily be packet-driven, and most services needn't run continuously.
asciilifeform: btw verisimilitude , you can already 'dispatch in hardware in o(1) by port number' given as ethernet is a bus. set n boxes (1 per port) to sit on same switch, all set to same 'mac', but each only processing packets having its respective port.
asciilifeform: in fact asciilifeform's lan already worx quite like this.
verisimilitude: Oh, that's neat.
asciilifeform: and phree.
asciilifeform: 0 coad req'd.
asciilifeform: 'best machine is no machine'(tm)(r)(altschuller)
verisimilitude: Updating that mapping would be less convenient, right?
asciilifeform: as convenient as could be -- adjust the box where $service.
verisimilitude: Still, imagine a bunch of tiny machines in one doing this.
verisimilitude: Some of those machines wouldn't even need memory.
asciilifeform: some of'em wouldn't even need to be powered!1
asciilifeform: or what means 'wouldn't need memory' there?
verisimilitude: Well, I keep trying to properly imagine useful ``non-von Neumann'' architectures for such tasks, and some services wouldn't need calculations beyond traversal or whatnot done by hardware that doesn't need memories that are only capable of identity and nothing else.
verisimilitude: I suppose if I tell someone to imagine a hardware trie, say, there's still memory, but it's not only memory.
dulapbot: Logged on 2021-01-04 14:25:10 asciilifeform: verisimilitude: in other rec'd reading. (d. hillis. 'the connection machine'.)
← 2022-05-31 | 2022-06-02 →