3900+ entries in 0.253s
phf: diana_coman: yeah, i remember the python
2/3 rants in logs here too. i take it s.mg at this point mails CDs of prefab player AND developer environments
☟︎ lobbesbot: Logged on 2016-11-28 14:51:45: <diana_coman> basically whatever blender version is the last to work on python
2.x
diana_coman: phf, quite; Blender
2.66 for the record; the stopping point though was basically latest working with acceptable version of Python
lobbes: Top three things I need to do next: 1) set up automated updating of the reporting database the thing sits on (currently 'stale' data).
2) set up lobbesbot to similarly search via IRC commands 3) Zip distribution system!
☟︎ TomServo: asciilifeform: Am I mistaken there are
2 types of fg? 1 usb, 1 rs232 ?
shinohai: Aside from that one, we have Bitcoin Smart and Bitcoin Interest within ~
2 weeks
mircea_popescu: would have delivered much better results in 2018 than the path actually taken,
2), where assange sat in cramped ecuador embassy quarters for five years and got a ~toilet paper roll's worth of pompous "un declarations".
mircea_popescu: "usg made the us army into what it is today" "you mean a useless piece of shit, janissary corps
2.0 ?" "yeah!"
mircea_popescu: 1. i say !S
http://pastebin ;
2. bot searches for an image ; 3. bot embeds the pastebin in image ; 4. bot publishes the new image to its tumblr acct. ;5. bot links image here.
mircea_popescu: mod6 yeah, they were protected in old country most places also, it was the #1 trimmer of noob hunters. "don't wait to see what you're shooting, get a falcon, spend
2 weekls explaining self to forest guard"
BingoBoingo: <mircea_popescu> next you're going to tell me doge isn't the new ether anymore or something! << Hey, touched
2 billion market cap this week!
jhvh1: mircea_popescu:
2^256 - 1 = 1.157920892373162E77
shinohai: I think I only spoke
2-3 times when I first came here with them
btcvixen: My mind, my strength, and my integrity are worth far more than those
2 bitcents of pittance you offer me.
btcvixen: mircea_popescu, i generated 6600 coins cpu back in 2010, unfortuantely i got raped and spent them on heroin and they were gone by march of 2012 when they were worth $
2 a pop
trinque: this 1) agreeing ahead of time with pantsuit council on what schemas exist or
2) infinitely nested lookup tables for viewers is exactly what killed the prior idiots
mircea_popescu:
2. the client queries whichever gns it is configured to, and inquires as to contacting machines which hold data related to this item. it receives a list of them, on the basis of what signatures mircea_popescu told it to trust signed.
a111: Logged on 2016-11-30 23:06 asciilifeform: of all the plagues discussed in this thread, i'd say fonts are the mildest, it is at this very minute quite trivial to operate a machine with
2-3 fonts installed , with ~0 surgery
BingoBoingo: If
2 doodz spread the candidiasis while spreading the AIDs
a111: Logged on 2017-11-29 01:41 asciilifeform: funnily enough adacore itself publishes a great many cut-down runtimes for various embedded boxes, e.g.
https://bitbucket.org/tkoskine/embedded-arm-gnat-rts/src . BUT they are not usable: 1) there is -- quite deliberately -- not one targeting conventional userland linux
2) none of them support exception handling, which wouldn't be a problem except that ALL BOUNDS CHECKS ARE EXCEPTIONTRONIC
a111: Logged on 2015-08-22 00:10 mircea_popescu: 5.
2.3. Version 4 Signature Packet Format
shinohai: ^ neat asciilifeform ... I'm a bit slower learning these bits (like debug flag
2 didn't work on gpg2 because mpi) but patience.
mircea_popescu will pay
2 bitcents to the first l2 (not l1) that produces timing data, to the same standard as teh graph, + machine spec.
mircea_popescu: through some discussion it emerged that A.1 and A.
2 are not practically distinct, one just provides the memory for the implementation fo the other as a foremost feature.
mircea_popescu: problem A has two possible legitimate answers : A.1 : introduce a further parentage chain (so patch does not discuss merely file hashes but also somehow a hash of prev patch) and A.
2 : introduce a magic file which must (by protocol) be touched by all patches.
mircea_popescu: 1. problem S (alf's) is entirely spurious and not part of this confersation, go talk to dreamweaver about it ;
2. problem A (trinque's) : "if two patches with same antecedent touch disjunct filesets, how does establish which came first" ; 3. problem X ( ben_vulpes 's) : "if i totally sabotage v into a piece of shit entirely contrary to its everything, will you hit me in the head ?"
a111: Logged on 2018-01-05 19:06 mod6: my vtron has been discussed very much over the last
2+ years. i remember many disucssions where rules popped out.
a111: Logged on 2018-01-05 18:28 asciilifeform: no good. first of all suppose there are
2 concurrent runs of the vtron ( say this is a cuntoo pressing itself )
trinque: there are two questions conflated here; 1) what is the expected state of the patient and
2) what is to be done to him
mod6: my vtron has been discussed very much over the last
2+ years. i remember many disucssions where rules popped out.
☟︎ mod6: <+asciilifeform> no good. first of all suppose there are
2 concurrent runs of the vtron ( say this is a cuntoo pressing itself ) << yeah, concurrent runs of my vtron are a no-go.
mod6: so goal is to fix this problem. then carry on and document all the rules the thing has in place. this way, others can try to build in those rules we've discussed in here to their vtrons without having to fish them all out of
2 years of logs.
mircea_popescu: "oh,
2 is a great witness for odd composites" "so would have been any other even number" "yes but... umm..."
mircea_popescu: what nsa gains from being able to rely on
2 rather than 44444444444444444 is anyone's fucking guess
mircea_popescu: i'm dealing with "four rounds of m-r and a 5th fixed with
2, so as to fix the cone of blindness" bs and you want me to care about the 2047th bit ?
mircea_popescu: any of 6 bits not being set -> chucked item ;
2^6 = 64 so 1 in 64 ie 1.5% or so pass.
a111: Logged on 2018-01-04 22:30 asciilifeform: 'top
2 bits and bottom bit are ALWAYS 1!' << asciilifeform still doesn't get why to weld the next-to-highest
mircea_popescu: so you want "\t\t\t\t\tcsRef<iMeshWrapperIterator> objectIter = engine->GetNearbyMeshes(mesh->GetMovable()->GetSectors()->Get(0), oldpos + boundingBox.GetCenter(), boundingBox.GetSize().Norm() *
2);" to be instead
a111: Logged on 2018-01-05 01:18 mircea_popescu: it should be evident that 1. i can argue for epicycles and
2. unless you're at least this tall to ride (which is -- MUCH taller than average college professor), you CAN NOT dispel them out of my hand.
mircea_popescu: it should be evident that 1. i can argue for epicycles and
2. unless you're at least this tall to ride (which is -- MUCH taller than average college professor), you CAN NOT dispel them out of my hand.
☟︎ mircea_popescu:
http://btcbase.org/log/2018-01-04#1763745 << /me dutifully follows, and duly falls upon "
2) What was not implemented until recently was functions returning unconstrained arrays. This is a very tricky thing to do, as I'll describe in a moment. The week before Tri-Ada, I added a temporary, kludgy implementation to GNAT. About the only thing it had to say for itself is that it worked, but it creates serious memory leaks. It
☝︎ phf: "Oh, good evening my hackfriends! I am just chuffed to share a thing with yall: tomorrow we release Guile
2.
2.0. Yaaaay!"
phf: the way btcbase does it is first pairs all patches by name (following our convention, but next by subst distance), processes those and what's left over is brute forced. algo though was implemented back when naming convention was in flux, so in practice it's o(n), but in reality it could approach o(n^
2) if patch bucket is full of shit
a111: Logged on 2016-01-18 15:58 ascii_butugychag: the O(N^
2) instrinsic runtime of unknown-patch-bag+unknown-sig-bag is something i realized from the start
mircea_popescu: ;; It's simple to determine which vpatches have parents;;; just scan linearly. Performance is O(n^
2). << this hurt me painfully.
a111: Logged on 2017-12-25 18:07 mircea_popescu: so, to get on the same page here, the general strategy is, 1. construct undisruptable comms ;
2. disrupt usg&friends comms ; 3. disrupt usg&friends physical presence.
mircea_popescu: phf you know, "kinky" is rapidly becoming a very dirty word, sorta like "moron" ? 99% of my exposure to "kinky" comes from reviewing bot logs, where the pattern is 1. item self-identifies as "kinky" ;
2. bot goes through HELO/EHLO with them, provides entry point ; 3. they come back with "here is my valuation of $entry-point". because totally, anon bitch on meat market is a) in some kind of position of power and b) being asked
phf: !A .3.
2.0 {'_}{_}_ #
phf: !A .1.
2.1 {'_}{_}_ #
phf: !A .3.
2 ``< #[, ]#[, ]#
phf: !A .1.
2 ``< #[, ]#[, ]#
phf: !A .3.
2 ``<{'_}{_}_ #
phf: !A .1.
2 ``<{'_}{_}_ #
danielpbarron: step 1) get the user base. step
2) ??? step 3) fuck it, change everything maybe we get moneyz