log☇︎
15300+ entries in 0.03s
mod6: what does alf's dream turing machine look like?
mod6: s/unit/cell/
mod6: there has got to be an individual cost, but it's probably rolled up into single "unit" of storage.
mod6: *debiased
mod6: so can actually, cleanly, be dibiased?
mod6: cool pic.
mod6: "and refresh after read."
mod6: Yeah, kinda looks like it. (Was just taking a peek there...)
mod6: back when that was a thing it probably was more affordable for Mr. Luser. What about these days?
mod6: asciilifeform had a interesting dream too haha.
mod6: asciilifeform: intresting though.
mod6: my bad.
mod6: oh oh, we're ourselves on two seperate branches of conversation.
mod6: they're lying to me
mod6: https://en.wikipedia.org/wiki/Branch_%28computer_science%29
mod6: The other technique is to write programs without branches, or with fewer branches, typically using bitwise operations instead. [1] [Knuth, Donald (2008). The Art of Computer Programming. Volume 4, Pre-fascicle 1A (Revision 6 ed.). pp. 48-49.]
mod6: right, ok.
mod6: oh. right, can't you avoid them with bitwise ops?
mod6: if not, maybe a word or 6 on what you're getting at there.
mod6: oh do i understand you correctly on the branching problem -- if the stackframes are signed, how will i know (in advance) which address to jump to if all addresses are assigned at run time?
mod6: heheh. i'll have to scroll back.
mod6: was weird. maybe i took the acid.
mod6: ah.
mod6: ok
mod6: you know what i'm trying to say?
mod6: i dunno, on some weird paranoia tangent of trying to "only execute what alf said was good."
mod6 hands deedbot an ice-cream cone
mod6: a register before executing the next op.
mod6: is there anything to my wack-o dream? could a method be developed to have signed stack frames that the cpu would only execute up successful validation? would this even be worthwhile? probably not, a guy can still probably grab the IP and point it where he likes. probably would have to have some sort of pipeline (is this a thing?) that would make sure that there was valid checksum (from signature) held in
mod6: yeah, basically.
mod6: i was like WOAH.jpg
mod6: hahaha.
mod6: he was going to do this V like thing where each op has a corresponding hash, and at the end of all the ops, the hashes had to match or the cpu wouldn't execute the thing...
mod6: i had this dream lastnight that alf called me and wanted to tell me about this new method of processing... but i couldn't hear him very well as I was going through this tunnel.
mod6: the pics of the rigs these guys had of their GPU farms kill me
mod6: i hear you there. fuck, still snowing in my sector.
mod6: we get a log yet/
mod6: shinohai, what's the word on the street?
mod6: :D
mod6 sells to open
mod6: jurov: haha
mod6: 'imitation is the highest form of compliment'
mod6: herp to the derp mod6
mod6: w/e btc only :] whatever that represents.
mod6: eh M0 i guess
mod6: (17:57) <+mircea_popescu> shinohai> I see there is no way shinohai can just donate the shares back to qntra and forget about it all. << you can prolly instruct jurov to sell them and donate proceeds to foundation say. << this is exactly the correct approach. this way we take a btc donation (tyvm!) and we continue to only hold M1
mod6: <+trinque> since I grew up in a sewer, the fact that you can go edit a running common lisp program will always bring me great joy. << this is very cool
mod6: let us hope not.
mod6: :)
mod6: yah, we've discussed a bunch.
mod6: foo[-1]
mod6: haha
mod6: this is your fav. isn't it?
mod6: ya, i'd give you a coin to bundle them up for me -- i'll store 'em somewhere for safe keeping.
mod6: but stopped iirc once it was #b-a
mod6: its a cryin' shame. i /used/ to log shit like a long time ago when it was #bitcoin-otc
mod6: irk
mod6: <+mircea_popescu> mod6 hey man do you have bouncer logs of historical b-a ? << sadly, no. :/
mod6: http://therealbitcoin.org/ml/btc-dev/2016-April/000219.html
mod6: sluts are universal
mod6: thx
mod6: aight
mod6: or is someone working on that?
mod6: we need a loggerthingy for #trilema
mod6: "
mod6: "BCD1
mod6: nice bush
mod6: aight, thx alf
mod6: heheh
mod6: ah
mod6: two wheels, this would keep the overall footprint the same throughout.
mod6: ?
mod6: ok, so ; new block is found. we serve the live block queue (size 64 blocks, oldest (height-wise) is in the front) and recycle the memory, appending it to the end of the free queue. we then serve the free-list queue, populate it with the data from the new block and append it to the live block list
mod6: i had to look it all up in the reference
mod6: i think i was just trying to follow that thread in my own sense of it.
mod6: <+asciilifeform> as in, re-use the blocks sanely. << ok so we'd have to therefore keep a 'free list' - a list of objects/items that have been deleted and are "recycled" and may be used again or I suppose we could then call 'Ada.Unchecked_Deallocation' on an item in the free list to shink the list thereby reclaiming the memory.
mod6: haha, plz link if you find it.
mod6: no worries though, it'll be there.
mod6: yah, there's a lot of stuff. trilema will probably get you caught up as a readers-digest
mod6: so we'll see.
mod6: mp has some neato non-ada ideas surrounding sponges
mod6: bingo
mod6: k
mod6: could require a true hardfor
mod6: but not sure if we can make it happen with breaking ourselves off into our own universe.
mod6: btc has to work better than a 767
mod6: if its possible at all.
mod6: he'll still be in kindergarden.
mod6: i'll catch up by the time im like 394 years old.
mod6: alf just sits back and laughs
mod6: so that's been kinda cool.
mod6: bunch of us have been learning scheme and Ada
mod6: lol, first SoBA to have literally no activity. i gotta grind hard in April i think.
mod6: speaking of which, i literally did jack fuck all this past month on trb
mod6: alf and mp came up with a thing called 'V'
mod6: not much changed around here; still got coinz, still got that drama
mod6: cool.
mod6: werd. glad you're catchin a break a bit. last we talked you were mighty swamped with stuff.
mod6: mhmm.
mod6: u too man