00:00:24 It needs to be revitalized by drug money 00:03:18 i'd imagine moore's law figures in that somehow. 00:04:51 *into 00:07:21 In theory, there's some sort of equilibrium (the fewer miners there are the more attractive it is to mining), and of course a competition for mining faster and more cheaply (this explains the move to ASICs that happened this year.) 00:08:03 the fewer miners part doesn't apply if there's no _marginal_ profit at all. 00:08:07 i'd think. 00:09:50 also that profitability needs to sustain all bitcoin transactions happening everywhere 00:09:53 there are supposed to be transaction fees to compensate for the lack of new coins being minted 00:09:58 * int-e shrugs 00:10:02 ah 00:10:10 such freedom 00:10:12 so liberty 00:18:47 mining stops eventually, anyway? 00:19:15 I think it continues forever? 00:19:31 oh. I guess I don't understand how bitcoin works then 00:20:31 I think like. mining gets you new coins + transaction fees 00:20:39 and the new coins slowly trail off? 00:21:10 so it never actually reaches the total number of bitcoins, just approaches it slower and slower? 00:21:17 no, it eventually reaches it 00:21:56 I think like it gives 50 per block, then 25, then 12.5.... plus transaction fees? 00:22:07 then surely mining eventually gets you 0 coins? what would be the point to mining then? 00:22:24 I think the transaction fees? 00:22:25 "mining" is the process of signing blocks of transactions. that needs to be done to keep the system going. the freshly minted coins are an incentive for doing so, but as I mentioned, transaction fees are possible (with transactions having fewer incoming coins than outgoing coins; the remainder can be claimed by whoever does the proof of work for the transaction's block) 00:22:49 okay, right. 00:23:24 the quantities are finite precision so eventually it does reach 0 00:25:28 (oddly I trust bitcoins about as far as I can throw them :) ) 00:30:58 http://bitcoin.sipa.be/ ... the growth in (totally wasted!) computing power is crazy. 00:34:16 clearly the future belongs to spamcoin, a cryptographically secure currency based on solving captchas. 00:36:21 haha 00:36:30 -!- nooodl has quit (Quit: Ik ga weg). 00:39:41 int-e, has anyone tried working out accusatory stats like power costs and carbon footprint yet 00:42:46 -!- Sorella has quit (Remote host closed the connection). 00:43:16 Hmm. Last I checked, ASIC hardware was computing about a billion hashes per Joule. (which is a couple of 100s times better than GPUs; I have no numbers for FPGAs, but they should be inbetween) 00:44:42 So we have something like a 6MW lower bound on the power usage, and it's likely to be quite a bit more. 00:45:30 20MW? 100MW? I don't know :) 00:49:33 actually https://en.bitcoin.it/wiki/Mining_Hardware_Comparison has MHash/J numbers for a fairly wide range of hardware, including FPGAs 00:59:46 -!- conehead has quit (Quit: Computer has gone to sleep.). 01:07:31 what kind of scam is this? http://carbonjar.com/ 01:36:33 -!- muskrat has quit (Quit: Leaving). 01:36:58 http://www.amazon.com/b?node=8037720011 01:37:07 Amazon is going to start delivering packages by drone, as soon as the FAA will let them 01:39:56 -!- Bike has joined. 01:40:17 Bike: http://www.amazon.com/b?node=8037720011 Amazon is going to start delivering packages by drone, as soon as the FAA will let them 01:41:04 i'm amused that i first heard that from a foreign policy person 01:41:31 anyway i don't thnk i see the point 01:42:43 explain? 01:43:14 maybe it's just me personally but the only thing i've wanted delivered in less than half an hour is dinner 01:43:49 well my house runs on Google Shopping Express 01:44:00 we don't *need* things same-day but it's convenient 01:44:15 (helps that GSE's prices are ridiculously unsustainably low) 01:44:26 hrm 01:44:47 when Amazon Prime was first announced I thought it was silly to care about getting stuff in 2 days instead of 7ish but now it feels like a big reason to buy things on amazon 01:45:03 well i don't use that >_> 01:45:12 i have it for free for now but i'm probably hooked 01:45:16 you raise the level of convenience available and give people a taste and they won't go back 01:45:20 i think i'm just unsure what to think of megacorporations being run by sci-fi fans 01:45:20 first hit's free, kids 01:45:36 Bike, can't be worse than them being run by businessmen 01:45:52 they are definitely run by businesspeople, whether or not they're also sci-fi fans 01:46:03 when i think of things being run by engineers i think of chinese dams. 01:46:16 don't kid yourself that the CEO of a $180B company is not a businessman 01:46:40 sure. and i mean they're all ignoring the 'mass social inequality is bad' bits of cyberpunk anyway 01:46:45 just cause you share some culture that was subcultural in the distant past 01:46:47 also I don't think ultra-fast delivery has to be a big part of the value proposition 01:46:55 thanks kmc for that pedantry 01:47:18 thanks P_H for that thing you do 01:48:00 (didn't little rich boys reading 30s pulp sci-fi grow up to be businessmen too?) 01:48:37 drones have the potential to be cheaper and a lot easier to manage logistically 01:49:00 compared to a big heavy gasoline-powered truck with a human inside, run by a third party 01:49:09 but I dunno, I haven't run the numbers or anything 01:50:05 then again the best ways to move huge amounts of cargo slowly hasn't changed that much in 100 years 01:50:10 boats and trains 01:50:17 containerization is a big deal though 01:50:34 * Bike imagines his dad breaking in "I think you mean SHIPS, kmc" 01:51:06 there's a lot of shipping stuff up and down the columbia, it's neat, though 01:51:58 gasoline-powered as opposed to what, kerosene-powered? 01:54:06 -!- yorick has quit (Remote host closed the connection). 01:55:20 hm i wonder how those projects on making kerosene from algae are going. 01:55:37 -!- conehead has joined. 01:58:42 Phantom_Hoover: mostly, small quadrotor drones are electric, I didn't check about this one though 01:59:23 oh i assumed they'd be like, jet uavs with boxes of books on little parachutes 01:59:30 i realise in hindsight that this is very silly 02:02:41 hehe 02:02:43 that would be awesome 02:02:46 ballistic package delivery 02:02:51 your pizza in 30 minutes or the next one's free 02:03:02 Bike: here's an interesting theory https://twitter.com/tcarmody/status/407321435016032256 02:10:57 -!- Sprocklem has joined. 02:13:03 wouldn't ballistic delivery be a massive artillery cannon firing delivery shells 02:13:30 A few weeks ago I saw someone repairing a Coca-Cola vending machine and once they closed it and left, they left the configuration menu active, so I was able to see the error messages in it and the sale count and so on; I don't know what all of the options mean though. 02:26:22 -!- Taneb has left ("Leaving"). 02:29:18 kmc: you know i was actually thinking that 02:29:25 well, i didn't make the china connection 02:32:54 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 02:34:11 zzo38: neato 02:34:26 I remember back in like 1998 reading about coke machines that were connected to the internet and thinking "wow that's cool" 02:34:38 there's probably a Serious Business usecase for that now 02:34:52 what are they on the internet for? remote reconfiguration? 02:35:02 -!- heroux has quit (Ping timeout: 264 seconds). 02:35:25 -!- heroux has joined. 02:35:39 price of dr pepper is raised one dollar in the middle of my purchase and i am arrested for fraud 02:36:06 i imagine it could be useful for logistics 02:41:18 -!- conehead has quit (Quit: Computer has gone to sleep.). 03:22:39 zzo38: a lot of machines leave the default passcode for the debug menu 03:28:30 quintopia: Yes I know, I have tried; on those machines I usually find the menu has read-only options, and you cannot do anything other than read the sale count, cash, and error message. 03:29:06 but it's very interesting to see which drinks sell most 03:29:36 Yes, you can check that. 03:37:39 -!- Sprocklem has quit (Ping timeout: 260 seconds). 03:42:32 -!- NamelessOne has joined. 03:48:55 "@SnoopDogg: My next record available in bitcoin n delivered in a drone." 03:49:02 -!- NamelessOne has left. 04:02:26 woo 04:02:53 of course, he'd have to charge like 2BTC to be able to pay for the drone 04:04:01 plus you'd have to be crazy to pay in a deflationary currency 04:08:13 #420 04:11:51 Maybe they are crazy enough. 04:13:28 itym "you'd have to be high to pay in a deflationary currency" 04:15:26 kmc: i thought it was "you have to pay in a deflationary currency to get high" 04:20:10 once upon a time yes 04:20:15 RIP SR :\ 04:20:51 it's back i thought 04:21:00 something else with that name anyway 04:28:01 SR? 04:29:16 St. Richard 04:29:41 kmc: BUT HOW CAN WE TRUST SOMETHING LIKE THAT EVER AGAAIN 04:29:58 silk road probably 04:30:20 rip silk road, 1197-1253 04:31:01 shachaf: WE'LL NEVER GET QUALITY CHINESE CLOCKS AGAIN 04:31:03 oh wait 04:42:26 I am writing Z-machine in Famicom. Currently I have 780 non-comment lines. (counted using egrep -cv $'^[\t ]*(;|$)') 04:43:45 Why does it seem many programs today fail to follow the UNIX way of using filters and pipes and that stuff? 04:44:34 tomorrow on jerkcity: QUALITY CHINESE CL?OCKS 04:45:32 has unix ever actually been pipe-based or has it been based on inconsitent arcane command linearguments forever 04:46:42 Bike: Well, a lot of things are; lp is although dvilj4 isn't unless its argument is - 04:47:26 how about, like, ls. or dd. 04:48:28 Well, ls is designed for output, not input; dd is not using the common syntax of other commands due to some strange reason, although it does use stdin/stdout if you don't tell it the filenames otherwise. 04:48:32 zzo38: probably because the unix way of doing things is not actually the best way for every situation? 04:49:04 quintopia: Yes, it isn't best for everything, but there is a lot of things it would work for but that they don't do it that way. 04:49:26 zzo38: i mean, ls does all its own coloring and sorting and stuff. 04:49:35 is there a turing complete language with only 2 instructions? 04:49:40 zzo38: it doesn't really make sense for imagemagick, for instance. imagemagick is a lot simpler the way it is 04:49:52 L8D: yes 04:49:55 what? 04:50:17 bitchanger, perhaps? just go to the tarpits section of the wiki and poke around. 04:50:52 L8D: sk combinators? 04:50:56 quintopia: Yes, for ImageMagick, it still does need the command to tell it the file type and all that stuff, and you might have more than one file; yet it still helps that you can tell it to use stdin/stdout if you don't give a filename (you still need the type) and that can be useful too 04:51:14 Bike: what is that supposed to mean? 04:51:23 L8D: sk combinator calculus 04:51:36 But I think for dvilj4 it would make more sense to use pipe/filter (dvilj4 is a program to convert DVI to PCL) 04:52:29 yeah no 04:52:52 sk combinators need i combinators to be turing complete 04:53:01 and bitchanger is 4 instructions 04:53:05 L8D: http://esolangs.org/wiki/Impera 04:53:06 L8D: No, it doesn't, i can be made from sk 04:53:07 L8D: um i = skk 04:53:18 zzo38: you can? 04:53:21 L8D: also /// is TC with only / and \ 04:53:57 shachaf: Like oerjan said, i = skk 04:54:20 well, I’m looking for something that can be hidden in the bits of a file 04:54:22 not bytes 04:54:25 bits 04:54:35 zzo38: i thought you said you can be made from sk 04:54:45 L8D: take a look at iota and jot 04:54:49 L8D: you can hide any language in the bits of a file. 04:55:09 I’m talking about instruction-per-birt 04:55:10 bit* 04:55:40 it would be nice if there was some general way to put larger data into smaller data units 04:55:41 hmm can't think of any like that off the top of my head 04:55:46 like if there was some kind of code 04:56:00 but: http://esolangs.org/wiki/Bitwise_Cyclic_Tag 04:56:35 Bitwise Cyclic Tag works...I guess 04:57:38 you know how when you have italic text inside other italic text you just un-italic it? 04:57:41 that's the worst thing 04:57:54 in what scenario? 04:58:07 you can do nested italics tags in HTML 04:58:13 what's wrong with that shachaf 04:58:16 shachaf: In MediaWiki, do you mean? 04:58:18 FooVar 04:58:36 L8D: Jot might be more compact than BCT 04:58:40 And you can use HTML italics in MediaWiki too 04:59:02 here's a bunch of others to try: http://esolangs.org/wiki/Category:Turing_tarpits 04:59:17 cool 05:00:10 I once read on Wikipedia some article about classical logic, one of the sections game what looks to me like SK calculus with one more rule dealing with negation. 05:03:35 SK calculus is like the curry-howard correspondence for the hilbert axioms of logic. 05:04:12 oops pressed return too fast 05:04:32 it occurs that i have the first google hit for "ptrace for breakfast" 05:05:11 i just came up with an idea for a two-instruction tape-based imperative TC lang 05:05:21 because i couldn't find one on the wiki 05:05:23 i like ptrace and breakfast 05:05:50 https://en.wikipedia.org/wiki/Curry-Howard_correspondence#Correspondence_between_Hilbert-style_deduction_systems_and_combinatory_logic 05:06:15 has there ever been a relevant dilbert parody 05:06:38 hilbert, not dilbert, bike 05:07:12 no i mean dilbert but about hilbert 05:07:20 aha 05:09:54 oerjan: do you know how many nested conditionals are required to implement the simplest turing machine 05:09:55 maybe they could reanimate him as a zombie or something 05:10:03 quintopia: no hth 05:10:11 oerjan: tdnh 05:23:35 oerjan: do you know of a lang that is TC without being capable of nested loops or conditionals, or which bounds the number of nested loops or conditionals? 05:24:10 what do you mean by capable 05:25:17 i thought it was obvious. why do you ask that? 05:25:52 because (one) if it's TC it can emulate a system with unbounded loops (two) we were just talking about combinators which you surely know about and don't have loops or conditionals 05:26:44 well again, i'm thinking only about imperative langs here 05:27:23 so i guess 05:27:35 i mean that if you want to do unbounded loops 05:27:40 you have to roll your own 05:27:52 because the lang itself supports no such constructs in its syntax 05:28:02 (or unbounded nested conditionals) 05:28:51 ok, scheme doesn't have loops, how about that. 05:29:40 i always thought of scheme as mostly functional 05:30:00 it has begin. 05:30:28 -!- oerjan has set topic: IT HAS BEGIN | Although maybe if something else strange is done, it might not? | https://dl.dropboxusercontent.com/u/2023808/wisdom.pdf http://codu.org/logs/_esoteric/ http://tunes.org/~nef/logs/esoteric/. 05:30:30 present tense? 05:31:14 it has a special form (or maybe it's a macro, who cares), "begin", that does a sequence of things one at a time. "imperative" 05:31:17 okay let's make it simpler: know of any imperative TAPE languages with bounded depth of loop/conditional? 05:31:40 (of course more simple means morel ikely to get a "no" but i have to try) 05:31:43 pretty sure bf is TC with bounded depth. 05:31:59 yeah, there you go. 05:32:44 oerjan: what bound? 05:32:49 probably as little as two deep. 05:33:31 a main loop to keep things running, and subloops to do various conditional stuff. 05:33:48 any implementation of another language in brainfuck would establish a bound, no 05:34:00 yeah i'm looking at the TM impl in BF. 05:34:14 it's nested very deep 05:34:42 http://www.hevanet.com/cristofd/brainfuck/dbfi.b a bound: however deep this is 05:35:05 like five or six probably 05:35:06 bam 05:44:26 oh i was just looking at that 05:44:49 yeah it's six 05:44:50 or you could just write a SUBLEQ interpreter or some shit 05:44:53 for that interpreter 05:47:14 okay i got it 05:47:19 sweet 05:49:30 Do any SQL systems support trigger indices? (Meaning an index on a field of a table or view, but not for the data, but rather for all triggers on it having conditions where one of them is separated by AND and tests if that field is equal to some value, then it places it in that index slot.) 05:53:54 regclobber.c:69:5: warning: ‘main’ is normally a non-static function [-Wmain] 05:53:57 exciting variation! 05:54:13 also the syntax for attributes on function definitions is f'd up 05:54:13 void __attribute__((noreturn)) finish(int retval) { 05:55:02 vs for a declaration: void finish(int retval) __attribute__((noreturn)); 05:55:23 -!- oerjan has quit (Quit: leaving). 05:58:44 why'd they switch the order on declarations 05:59:35 probably some awful syntactic ambiguity 05:59:39 beats me 06:03:34 GiveDirectly expanded into Uganda: http://www.givedirectly.org/blog_post.php?id=4639869356775728332 06:03:39 "In the extremely rural areas where we chose to work, few households possessed government IDs (required to register for mobile money) so we had to find creative ways to expedite ID procurement" 06:03:48 no further detail is given 06:09:56 What channel do I go to for cryptography? 06:10:10 I want to ask them what book I should buy 06:10:17 ##crypto 06:10:26 thanks 06:10:32 I had a book once but I forget the title 06:10:37 i liked scheiner's. 06:10:41 kinda informal i guess. 06:11:08 Applied Cryptography? 06:11:10 it's... outdated 06:11:12 http://sockpuppet.org/blog/2013/07/22/applied-practical-cryptography/ 06:11:25 shows what i know. 06:11:33 Cryptography Engineering is supposedly better 06:11:58 the ##crypto topic links to http://www.cacr.math.uwaterloo.ca/hac 06:12:08 cool how these books all have almost the same title, eh? 06:12:43 my book will be titled "engineering applications of cryptography" 06:15:39 Whatever book it was I read, explained several things including encrypted poker games and secret sharing algorithms. 06:16:33 Select any point in the plane and generate a bunch of equations of lines all of which pass through the point; you need any two of them to figure out what point is meant. 06:17:51 those are cool yeah 06:18:01 zzo38: what do you think about zero knowledge proofs? 06:18:31 they're pretty neat 06:18:35 (Several things would have to be taken into account to make a secure implementation though, I think) 06:19:26 kmc: I didn't really remember much about how zero knowledge proof works; maybe I can look it up later to understand better 06:19:49 ZKP that I know a 3-coloring of some graph we both have: i write down colors for every vertex on slips of paper and put them face down on the table. you pick an edge. i reveal those slips and burn the rest. you see that they name different colors 06:20:27 we repeat this until you're convinced i'm not just lucky. but i randomly permute the 3 colors between rounds so that you can't assemble an overall coloring 06:20:54 for an electronic version, replace slips of paper with http://en.wikipedia.org/wiki/Commitment_scheme 06:21:00 Ah, OK. Yes I have read about that (but I think not in a book though) 06:21:22 it's pretty amusing to imagine this actually being done with slips of paper 06:21:28 kmc: "commitment scheme" would be a good name for a lisp dialect 06:21:29 between outlaws in the wild west, perhaps 06:21:39 which is similar to "encrypt them and then reveal some keys" but actual encryption schemes don't have all the desired technical properties 06:21:42 refusing to reveal the knowledge of where the treasure is 06:21:55 that would be awesome Bike 06:22:10 you should write this story 06:23:45 it would be easier to plot if it was a hamiltonian cycle or something instead 06:23:56 what about negative-knowledge proofs 06:24:06 where you end up being more confused than when you started 06:24:10 TA's lament 06:24:18 also student's lament I guess 06:25:11 pretty sure that is bike's lament 06:26:01 traditional ZKPs are all interactive like that, but there are non-interactive variants 06:26:14 huh, i didn't know hamilton tried to make 3ions for path finding 06:26:27 somehow i forgot that it's the same hamilton as quaternions 06:26:37 where I hash the problem description and use the bits of the hash output as your random choices 06:26:38 what's a good non-interactive zkp 06:26:50 oh 06:27:00 and provide enough answers that it's implausible I brute-force tweaked the problem description to get favorable coin flips 06:27:17 i don't understand all the subtleties of how to make this work properly 06:27:23 where can i read about that 06:27:37 Zerocoin uses non-interactive ZKPs, committment schemes, *and* one-way accumulators to build true anonymity into the bitcoin block chain 06:27:40 p. cool stuff 06:27:49 shachaf: don't know but "non-interactive zero-knowledge proof" should be a decent search term 06:27:53 i bet the zerocoin paper has citations too 06:27:54 obviously snoop is on the wrong boat 06:28:36 i think anonymously buying an album with complementary weed from snoop with zerocoin would be the most cyberpunk thing i could do in my lifetime 06:30:28 what's that music thing that sometimes is played at the end of some old films 06:41:59 In a 6502 code, is asl a asl a asl a php php ror a plp ror a plp ror a a proper way to sign-extend a number? 06:42:56 http://i.imgur.com/ZgXds9B.png 06:43:33 "Ah. I guess it's supposed to various. Unnecessary but kinda makes sense." 06:43:43 anti-various protection 06:43:54 "anti-various pro" yes that 06:56:49 -!- Sgeo_ has changed nick to AntiVariousPro. 06:57:58 -!- AntiVariousPro has changed nick to AntiVariousProte. 06:58:00 Meh 07:04:04 Are there any computers (or VMs) other than VAX that have an "increment immediate" instruction? 07:06:10 what does that do? 07:07:14 Increments the instruction operand itself rather than whatever it points to 07:08:21 (Of course it won't work if the instructions are stored in ROM, but if that address is also mapped to bankswitching or something else, then it would affect that too) 07:12:05 -!- FreeFull has quit. 07:12:56 -!- redpine has joined. 07:13:33 -!- redpine has left ("Leaving"). 07:26:29 -!- Slereahphone has joined. 07:28:14 -!- L8D has quit (Ping timeout: 240 seconds). 07:50:22 -!- Slereahphone has quit (Ping timeout: 246 seconds). 07:52:26 ah you can also do __attribute__((noreturn)) void finish(int retval) { ... 07:53:28 so it's like 'static' or whatever... you can do void static f(...) as well 07:53:28 that's a bit less terrible 07:53:41 OK 08:00:33 Do you know any cheat code for Pokemon Card GB2 to cause it to always use six side cards instead of four? 08:02:52 -!- Slereahphone has joined. 08:03:39 no 08:06:19 -!- Slereahphone has quit (Client Quit). 08:07:00 shachaf: one interesting property of ZKPs is that if you watch a recording of me convincing zzo38 i can 3-color this graph, you are still not convinced at all 08:07:04 because we might have colluded 08:07:30 it's a weird sort of "knowledge" which can't be transferred 08:07:33 but non-interactive ZKPs do not have this property clearly 08:08:05 kmc: I noticed that just a minute ago when I looked on Wikipedia, it says something like that too. 08:10:13 oh i didn't know that ZKPs came from the same paper which introduced the IP complexity class hierarchy 08:18:22 kmc: can zzo38 convince me that the ZKP was convincing without actually knowing your secret 08:23:56 probably not 08:24:19 maybe he can do something like a n-i ZKP but not reveal to me that this is where the bits came from 08:24:22 and then reveal it to you later 08:24:33 not sure 08:25:10 or use the hash of today's jerkcity strip or w/e 08:30:38 Are there any variant of zero-knowledge proof which is involving quantum entanglement? 08:32:25 kmc: did you see http://blog.sigfpe.com/2013/10/distributed-computing-with-alien.html 08:35:59 interesting 08:36:21 "If the conjecture is true it means that nature looks a bit like a conspiracy to keep computer scientists in work." yes i've wondered that 08:37:43 full employment theorem, mexican hat functionn, 08:37:44 perhaps the anthropic principle applies and all the universes where computer stuff is easy have already been tiled with smiley faces 08:41:53 I think we should query fungot for input on the topic 08:41:53 FireFly: wrong channel to let that go.), but that was the great thing about perl is what i've done so. the dynamic analyses assume an open world, and i'll be pretty happy with araneida ( in cl parlance)? so i can just use this and skip the actual installation 08:47:25 -!- zzo38 has quit (Remote host closed the connection). 08:48:35 ^style illuminatus 08:48:36 Not found. 08:49:27 kmc: i like smiley faces 08:59:13 ☺ 08:59:39 `run perl -e 'print "☺" x 1024' 08:59:42 ☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺☺� 08:59:45 gj 08:59:55 😍 09:00:01 hm did that render for you 09:00:04 `run ls bin | paste 09:00:07 no (screen?) 09:00:12 http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/paste/paste.27992 09:00:18 it's a non-bmp character 09:00:24 but it's not showing up in tmux either :'( 09:00:34 it's U+1F60D SMILING CAT FACE WITH HEART-SHAPED EYES 09:00:54 wait, no 09:01:06 that's just a SMILING FACE WITH HEART-SHAPED EYES 09:01:07 -!- oklopol_ has joined. 09:01:09 i was cheated out of a cat! 09:01:14 😻 09:01:18 at least it's showing up in the logs 09:02:03 `run echo '#!/usr/bin/perl -e' > bin/perl-e && chmod +x bin/perl-e 09:02:07 No output. 09:02:27 `perl-e print "Vanilla milkshakes from Hard Rock cafes\n" 09:02:28 Bareword found where operator expected at -e line 1, near "/hackenv/bin" \ (Missing operator before bin?) \ syntax error at -e line 1, near "/hackenv/bin" \ Execution of -e aborted due to compilation errors. 09:02:31 fuckers 09:02:48 `which perl 09:02:50 /usr/bin/perl 09:03:36 `run printf '#!/bin/bash\n\nperl -e "$@"\n' > bin/perl-e && chmod +x bin/perl-e 09:03:40 No output. 09:03:54 `perl-e "Enlarged by nature to show true texture.\n" 09:03:55 No output. 09:03:59 `perl-e print "Enlarged by nature to show true texture.\n" 09:04:00 Enlarged by nature to show true texture. 09:04:14 -!- oklopol has quit (Ping timeout: 240 seconds). 09:06:25 `perl-e print "It's the devil's way now. You have not been " . "paying attention " x 8 09:06:26 It's the devil's way now. You have not been paying attention paying attention paying attention paying attention paying attention paying attention paying attention paying attention 09:07:57 fungot: go and tell the king that the sky is falling in when it's not 09:07:57 kmc: how so? it's not just thin syntactic sugar whereby multi could expand to ( atan z) be expanded to ( if let ( begin ( while ( vi pivot)) to ( begin ( blah...) 09:09:05 oklopol_: are you in chile? 09:16:43 the sky is expanding to (atan z)! 09:24:04 -!- CADD has quit (Quit: Changing server). 09:30:45 If you have a grammar, a string, a corresponding AST, and a change in the string (insertion/removal), and want to augment the AST by applying the change to it.. does that problem have a name? 09:31:28 'stuck writing Eclipse' seems like a problem to me 09:31:56 ._. 09:46:34 FireFly: http://codepad.org/98Q1bM4w 09:49:48 turns out the middle cell becomes 10 09:53:30 Hm 09:56:39 (Distortion does not cause other distortion now) 09:57:58 So one has to take distortion only into account when comparing cell values 10:03:15 -!- dwildman has joined. 10:03:24 -!- dwildman has left. 10:08:37 -!- mtve has quit (Quit: Terminated with extreme prejudice - dircproxy 1.2.0). 10:13:22 shachaf: don't you love that a file with the name is actually something super specific "for GDB and GDB only... Don't use it for anything other than GDB" 10:15:02 that's a lie, right? 10:15:11 which 10:15:21 "for GDB and GDB only" 10:15:37 You more or less have to use this file for ptrace. 10:18:43 right 10:19:10 (or you can use if you want to get them one at a time with PTRACE_PEEKUSER, but I think that's not supported on all architectures either) 10:19:15 then again, maybe using ptrace coutns as "you know what you are doing" 10:19:20 i think so yes 10:19:26 "that's why i go out of my way to use ptrace" 10:19:36 i think there's also a polite fiction that only gdb needs to use ptrace 10:19:50 Well, ptrace(2) specifically mentions sys/user.h 10:19:52 or was n years ago when that comment was written 10:20:02 what about strace (the best program) 10:20:15 i wonder where I read to use reg.h 10:20:22 if strace is so great why isn't it ltrace or lltrace 10:20:29 or.... dtrace 10:20:42 or that program i never got around to writing to trace mmap accesses 10:20:50 sorry i meant latrace not lltrace 10:21:07 why isn't it ☺trace 10:21:10 i have had the misfortune to need xtrace as well 10:21:31 i've either needed xtrace or not needed it and used it anyway 10:21:34 not sure which 10:21:48 i've never used latrace (or heard of it) and i've barely used dtrace 10:22:20 latrace is like ltrace but it uses LD_AUDIT to do its thing 10:22:41 LD_AUDIT is one of those features obscure enough that the first google hit is "GNU glibc Dynamic Linker 'LD_AUDIT' Local Privilege Escalation" 10:22:55 but it's useful for things other than writing exploits 10:23:58 imo write a combined {syscall,ray} tracer 10:36:18 sgtm 10:36:37 it will VISUALIZE the inside of the kernel 10:51:32 http://sprunge.us/BUQd best model? 10:59:38 -!- Sgeo has joined. 11:02:23 -!- AntiVariousProte has quit (Ping timeout: 260 seconds). 11:25:55 -!- MindlessDrone has joined. 11:37:57 -!- Hi has joined. 11:38:21 -!- Hi has changed nick to Guest10636. 11:42:27 -!- Guest10636 has quit (Ping timeout: 250 seconds). 11:48:11 -!- Taneb has joined. 11:57:40 -!- EgoBot has quit (Read error: Connection reset by peer). 11:57:47 -!- ggherdov has quit (Ping timeout: 240 seconds). 11:57:51 -!- quintopia has quit (Ping timeout: 240 seconds). 11:57:52 -!- quintopia has joined. 11:58:12 -!- quintopia has quit (Changing host). 11:58:12 -!- quintopia has joined. 11:58:17 -!- EgoBot has joined. 12:10:30 -!- ggherdov has joined. 12:13:12 Which is that popular language which is strong and static typed in a hideous way 12:13:43 java? 12:13:48 ada? 12:15:38