00:19:06 -!- sleffy has joined.
00:20:32 -!- MDude has joined.
00:20:42 -!- MDead has joined.
00:20:44 -!- MDead_ has joined.
00:22:52 -!- MDead__ has joined.
00:25:59 -!- MDead_ has quit (Ping timeout: 256 seconds).
00:25:59 -!- MDude has quit (Ping timeout: 256 seconds).
00:25:59 -!- MDead has quit (Ping timeout: 256 seconds).
00:26:08 -!- MDead__ has changed nick to MDude.
00:52:36 -!- jaboja has quit (Quit: Leaving).
00:59:35 -!- mniip has quit (Ping timeout: 240 seconds).
01:14:16 -!- mniip has joined.
01:14:17 -!- heroux has quit (Ping timeout: 272 seconds).
01:14:18 -!- heroux has joined.
01:14:49 -!- heroux has quit (Changing host).
01:14:49 -!- heroux has joined.
01:46:48 <\oren\> GOD THIS EXPLOIT IS SO SIMPLE
01:48:23 <\oren\> "access a one of 256 memory pages based on a byte of kerbal memory. although the access will throw an exception, that page will be in cache and the others won't, which is detectable."
01:49:42 <\oren\> this is a basically all computers newer than an Amiga
01:52:27 <\oren\> and their code is bascially
01:53:25 <\oren\> char *addr=KERNEL_ADDR;
01:54:11 -!- variable has joined.
01:54:36 <\oren\> Oh they have a loop too
01:55:33 <\oren\> int x=0;do x=a[*addr<<12];while(!x);
02:11:50 <int-e> okay, this confirms previous speculation that they made https://cyber.wtf/2017/07/28/negative-result-reading-kernel-memory-from-user-mode/ work
02:16:08 -!- ais523 has joined.
02:24:54 -!- erkin has joined.
02:27:32 <boily> also, he\\オレン＼. could you enthicken the radical of 砲 please?
02:28:11 -!- boily has quit (Quit: CALAMITY CHICKEN).
02:29:46 <quintopia> @ask boilyif you had to choose between living somewhere the temp is always below freezing or always above 35C, which would you pick
02:33:58 <ais523> definitely <0 for me, even 25°C is really painful to cope with and <0 is, if not normal here, frequent enough that I'm used to it
02:35:50 <shachaf> i'm sure boilyif will have a good insight on this hth
02:46:28 <oerjan> quintopia: poor boilyif will be so confused
02:46:58 -!- moony has joined.
02:47:53 -!- variable has quit (Quit: Found 1 in /dev/zero).
02:48:29 <quintopia> @ask boily if you had to choose between living somewhere the temp is always below freezing or always above 35C, which would you pick
02:49:36 -!- quintopia has changed nick to boilyif.
02:50:05 -!- boilyif has changed nick to quintopia.
02:52:59 -!- callforjudgement has joined.
02:53:49 <moony> We need to make a esoteric language based on speculative execution. Only way to get work done is to make it speculatively execute up to 10 bytes of code
02:54:48 -!- scarf has joined.
02:55:01 -!- ais523 has quit (Read error: Connection reset by peer).
02:55:18 -!- scarf has changed nick to ais523.
02:57:37 -!- callforjudgement has quit (Ping timeout: 248 seconds).
03:07:15 -!- moony has changed nick to Ajit-Pai.
03:26:56 -!- Sgeo_ has quit (Read error: Connection reset by peer).
03:29:11 -!- Phantom_of_the_o has joined.
03:38:05 -!- Sgeo has joined.
03:50:06 -!- erkin has quit (Quit: Ouch! Got SIGABRT, dying...).
04:28:54 -!- variable has joined.
04:47:13 -!- sprocklem has joined.
04:49:50 -!- Ajit-Pai has quit (Ping timeout: 252 seconds).
05:10:01 -!- doesthiswork has quit (Quit: Leaving.).
05:10:19 <shachaf> oerjan: do you have anything to do with http://www.hthworldwide.net/ twh
05:22:52 -!- ais523 has quit (Quit: quit).
05:23:02 <variable> shachaf: you're in other channels I'm in :-)
05:23:22 <variable> the only reasonable explanation: you're stalking me
05:24:00 <shachaf> but i was here first, and you already knew i was here
05:27:33 <variable> shachaf: but, but, what about my persecution complex?
05:28:03 -!- Guest6549 has quit.
05:28:11 -!- Slereah has joined.
05:28:35 -!- Slereah has changed nick to Guest58342.
05:39:29 -!- Phantom_of_the_o has quit (Ping timeout: 260 seconds).
05:41:19 -!- sleffy has quit (Ping timeout: 248 seconds).
05:41:44 -!- sleffy has joined.
05:54:29 <oerjan> variable: rest assured that we only persecute people who deserve it, like the paranoid hth
06:05:53 -!- oerjan has quit (Quit: Nite).
06:06:57 -!- doesthiswork has joined.
06:11:43 -!- variable has quit (Quit: Found 1 in /dev/zero).
06:59:04 -!- pelegreno has quit (Read error: Connection reset by peer).
07:00:16 -!- pelegreno has joined.
07:27:29 -!- pelegreno has quit (Remote host closed the connection).
07:40:42 -!- pelegreno has joined.
09:47:56 -!- atslash has quit (Quit: This computer has gone to sleep).
10:00:01 -!- sleffy has quit (Ping timeout: 248 seconds).
10:13:02 -!- puckipedia has quit (Quit: *eh*).
10:41:55 -!- puckipedia has joined.
10:45:45 -!- augur_ has joined.
10:47:45 -!- augur has quit (Ping timeout: 264 seconds).
10:52:59 -!- garit2 has joined.
10:53:00 -!- garit2 has quit (Changing host).
10:53:00 -!- garit2 has joined.
10:54:57 -!- garit has quit (Ping timeout: 264 seconds).
11:11:16 -!- GautamS has joined.
11:35:41 -!- boily has joined.
11:42:30 -!- garit2 has quit (Ping timeout: 260 seconds).
11:47:18 -!- garit has joined.
11:47:18 -!- garit has quit (Changing host).
11:47:18 -!- garit has joined.
12:02:44 <lambdabot> quintopia asked 9h 14m 15s ago: if you had to choose between living somewhere the temp is always below freezing or always above 35C, which would you pick
12:03:29 <boily> quintopia: QUINTHELLOPIA! above. I won't be confortable, but it's more colourful.
12:03:45 <boily> the horror... 21 best temp!
12:05:48 <lambdabot> LOWI 041150Z 27005KT 230V300 4000 RASN FEW002 SCT010 BKN017 00/00 Q1006 R08/29//95 TEMPO SNRA SCT010 BKN013
12:17:01 <lambdabot> CYUL 041200Z 02008KT 8SM -SN BKN045 OVC065 M12/M15 A2991 RMK SC7SC1 PRESFR SLP135
12:18:11 -!- boily has quit (Quit: MUMMY CHICKEN).
12:19:06 <int-e> . o O ( IT'S A WRAP! )
12:26:10 <garit> Always above +35*C (even at night) is deadly for high humidity - body cant cool down. While below 0*C is easy - just some insulation/clothes will fix it
12:40:34 -!- sdfgsdfg has joined.
12:55:29 -!- Vorpal has quit (Ping timeout: 252 seconds).
13:02:57 -!- Vorpal has joined.
13:02:57 -!- Vorpal has quit (Changing host).
13:02:57 -!- Vorpal has joined.
13:13:48 <b_jonas> always above +20 during the night already sucks. always above +25 during the day only could work in theory, but if you have always above +30 during the day, then in two or three weeks, the nights will be above +20 too, and even always above +25 during the day has some risk with that.
13:14:08 <b_jonas> I can't sleep well when the nights are too hot for more than a few days.
13:22:08 <b_jonas> `bobadventureslist http://bobadventures.comicgenesis.com/d/20180103.html
13:22:09 <HackEgo> /home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: bobadventureslist: not found
13:41:05 -!- mniip has quit (Ping timeout: 240 seconds).
13:44:35 -!- mniip has joined.
14:03:02 -!- yorick has joined.
14:57:49 -!- variable has joined.
15:25:24 -!- GautamS has quit (Read error: Connection reset by peer).
15:30:16 -!- GautamS has joined.
15:36:52 -!- variable has quit (Quit: Found 1 in /dev/zero).
15:38:08 -!- arcayn has joined.
15:43:14 -!- arcayn has quit (Ping timeout: 260 seconds).
16:07:48 -!- sebbu2 has joined.
16:09:43 -!- sebbu has quit (Ping timeout: 265 seconds).
16:43:37 -!- oerjan has joined.
16:45:40 -!- atslash has joined.
16:49:53 -!- atslash has quit (Ping timeout: 250 seconds).
17:45:20 -!- GeekDude has changed nick to GeoDude.
17:48:39 -!- garit2 has joined.
17:48:39 -!- garit2 has quit (Changing host).
17:48:39 -!- garit2 has joined.
17:49:20 -!- garit has quit (Ping timeout: 255 seconds).
18:08:28 -!- sebbu2 has changed nick to sebbu.
18:33:24 -!- oerjan has quit (Quit: Later).
18:49:33 -!- FreeFull has quit.
18:55:18 -!- FreeFull has joined.
19:05:21 -!- Phantom_Hoover has joined.
20:00:28 -!- sleffy has joined.
20:22:27 -!- sprocklem has quit (Ping timeout: 240 seconds).
20:40:48 -!- lleu has joined.
20:40:48 -!- lleu has quit (Changing host).
20:40:48 -!- lleu has joined.
20:41:01 -!- lleu has quit (Remote host closed the connection).
20:43:31 <int-e> I want something like +10 during nights, +20 during days.
20:47:05 <garit2> int-e: now you are surrounded by indians/africans who came there too because of the good climate. Whats your next step?
20:47:45 <int-e> garit2: I don't understand the question.
20:48:21 <int-e> (I carry on with my life.)
20:48:38 <\oren\> the pointer always has lowest 3 bits 0
20:48:41 <\oren\> so he figures, why not use those to store some metadata
20:48:50 <\oren\> thus ruining everything forever
20:48:51 <int-e> So how much did Bannon pay Trump for the advertisment?
20:48:52 <garit2> 'I want x temp' -> 'i would move to a place with x temp' -> 'i would have to deal with other people who live there' -> 'dealing with people who used to live in a good climate is hard(crime level is higher)'
20:52:12 <int-e> I don't like where this discussion is heading. But anyway, I strongly believe that this connection is overstated.
21:05:24 -!- jaboja has joined.
21:05:59 -!- sprocklem has joined.
21:34:18 <zzo38> This is a simple printing protocol I made up now: http://zzo38computer.org/textfile/miscellaneous/simple_print Please to review this and write whatever question/comment/complaint you have.
21:35:08 -!- GeoDude has changed nick to GeekDude.
21:46:09 -!- idris-bot has joined.
22:05:39 -!- ais523 has joined.
22:16:28 <zzo38> They said that if you go to the hotel and try to print a file from your computer, they only accept Microsoft Word files. But, you might not be using Microsoft Word. So, with support for this new protocol will be better (in addition, they should also have an internal fax line, as an alternative way to print). This does not mean they should remove what they already have.
22:19:20 <ais523> can't you just use an .odt file? most word processors should be able to produce one of those, and Microsoft Word can read it
22:20:24 -!- GautamS has quit (Read error: Connection reset by peer).
22:21:55 <zzo38> I suppose yes you could (you could even use .txt which Microsoft Word can also read I think), but still it might not be what you wanted; for example, you might be using TeX. This new protocol it doesn't care what program you are using
22:23:10 -!- GautamS has joined.
22:28:12 <zzo38> The existence of the MFM record is not meant to imply that you are necessarily using METAFONT.
22:28:28 -!- GautamS_ has joined.
22:28:40 <zzo38> Did you read this document?
22:31:57 -!- GautamS has quit (Ping timeout: 268 seconds).
22:38:09 -!- ais523 has quit (Remote host closed the connection).
22:38:22 -!- ais523 has joined.
22:38:57 -!- sprocklem has quit (Ping timeout: 240 seconds).
22:42:18 -!- GautamS_ has quit (Read error: Connection reset by peer).
22:44:09 -!- GautamS_ has joined.
22:45:20 -!- relrod has quit (Quit: .).
22:47:53 -!- relrod has joined.
22:47:53 -!- relrod has quit (Changing host).
22:47:53 -!- relrod has joined.
22:48:57 -!- GautamS_ has quit (Read error: Connection reset by peer).
22:50:40 -!- GautamS_ has joined.
22:53:41 -!- GautamS_ has quit (Remote host closed the connection).
23:10:37 -!- boily has joined.
23:13:04 -!- wob_jonas has joined.
23:14:04 <wob_jonas> ais523: have you seen tom7's video that he claims tries to explain some proof to beginners, but actually it doesn't? if so, do you also think that involving that linear logic thing is a huge overkill?
23:14:30 <ais523> linear logic is interesting, whether it's overkill or not depends on what the proof is about
23:14:41 <ais523> but "full" linear logic is fairly ridiculous and I don't really enjoy it
23:14:46 <ais523> fragments tend to work much better
23:15:14 <wob_jonas> wtf, how come nobody (on this chan apparently) looks at his content?
23:15:34 <shachaf> But I haven't seen that particular video.
23:15:44 <wob_jonas> ais523: this is a fragment. but it's still an overkill for what he's doing there I think.
23:17:59 <wob_jonas> what he's proving is that there's an algorithm (no runtime bounds claimed) for some problem. he's reducing it to a recent result that there's an algorithm solving satisfyability on some particular fragment of linear logic. but the problem is so simple he could just do a couple of multiplications to produce an upper bound, then a graph traversal to
23:17:59 <wob_jonas> see if there's a path between two points.
23:18:57 -!- grumble has quit (Quit: We all eat lies when our hearts are hungry).
23:19:21 <ais523> "graph traversal to see if there's a path between two points" is actually the defining problem of a particular complexity class
23:20:01 <wob_jonas> The problem is basically that the input gives natural number n, two vectors of natural numbers a and b of length n, and a set of vectors of integers S of length n; then
23:20:50 <wob_jonas> you consider the infinite symmetric graph whose nodes are the n-vectors of natural numbers (nonnegative is important), and there's an edge between two nodes if their difference is in S, then the problem asks if there's a path between a and b.
23:21:45 <wob_jonas> You solve this by multiplying everything to give a bound above which the nonnegativity condition is unimportant, and then searching a path on the finite subset of the graph cut there.
23:21:46 <ais523> that's equivalent to asking "can you repeatedly add/subtract elements of S in order to convert a into b", isn't it?
23:22:07 <wob_jonas> ais523: yes, but going through only all nonnegative states.
23:22:26 <ais523> oh, and elements of S can be negative?
23:22:30 <wob_jonas> The simple algorithm is like double-exponential or triple-exponential, but who cares.
23:22:41 <wob_jonas> ais523: yes, elements of S can have mixed signs
23:22:57 <wob_jonas> actually I defined the problem slightly wrong
23:23:18 <wob_jonas> but not too much I think, a simple algorithm still works
23:23:44 <wob_jonas> it's still just some traversal of some huge periodic symmetric graph
23:24:10 <wob_jonas> that's not, like, turing-complete because of fractran, is it?
23:24:55 -!- grumble has joined.
23:25:00 <ais523> wob_jonas: it becomes a problem of computing a basis of a vector space once you get rid of the problem with negatives
23:25:26 <wob_jonas> ais523: yes, but you can't ignore the negatives
23:26:35 <wob_jonas> hmm... now I'm no longer sure. maybe the simple algorithm only works if n=1, and he definitely wants the n>1 case
23:27:32 <wob_jonas> but I still think this graph is simple enough that you can compute an upper bound, even for n>1
23:27:41 <wob_jonas> I'll have to try to make a definite proof and ask tom7
23:27:48 <wob_jonas> it's just some stupid number theory
23:28:41 <ais523> wob_jonas: let's see, I see two distinct cases here
23:29:05 <wob_jonas> I don't think there's a polynomial algorithm btw, but that wasn't the question
23:29:39 <ais523> a) finitely many elements are reachable from a, b) infinitely many elements are reachable from a
23:30:06 <ais523> b) implies you can reach some vector with every element ≥ the corresponding element of a
23:30:14 <ais523> and a) can be determined by brute force
23:31:17 <ais523> so the only interesting case here from a computability point of view is the boundary case where you have b) but cannot have it with a strict equality (i.e. you can't reach a vector where every element is > the corresponding element of a)
23:31:34 <ais523> and even then, it's probably possible to have a hybrid between the two cases somehow
23:31:51 <wob_jonas> wait, did you say "computing a basis of a vector space"? that doesn't sound right
23:32:13 <wob_jonas> this needs lattice basises, not vector space basises
23:32:52 <ais523> wob_jonas: if you can reach a vector where every element is > the corresponding element of the original
23:33:08 <ais523> then you can use a vector space basis as you can just do the same sequence over and over again to make the elements as high as you like, then reverse it later
23:33:16 <ais523> err, you need to be able to do this for both a and b
23:33:21 <wob_jonas> what vector space is there even here?
23:33:40 <wob_jonas> this is all integers in the vectors
23:34:08 <ais523> although, hmm, a basis with multiplying by integers may be distinct from one which allows rationals/reals
23:34:28 <ais523> you might want to read up on integer programming
23:35:14 <ais523> I was looking at this a while back because I wanted to write a program that deduced the constants of an unknown LCRNG from its sequence
23:35:15 <wob_jonas> darn, I'll definitely need to think about this and write a full proof
23:35:20 <ais523> this is actually really difficult, I think it might be NP-complete
23:35:49 <ais523> and the existing algorithms for getting a good performance in the common case are really complex and I kind-of broke down halfway through trying to implement them
23:35:56 <ais523> and I'm not even sure if this case hits the common case
23:36:27 <wob_jonas> I don't see why it's even in NP. But we don't want an efficient algorithm, just an algorithm.
23:36:39 <wob_jonas> I don't even want a single-exponential one.
23:37:01 <ais523> note: the assumption I'm making is that the LCRNG is updated as x_(n+1) = (x_n * a + b) mod c, but we can only observe y_n = floor(x_n / d) mod e
23:37:27 <ais523> we don't know any of a/b/c/d/e, but the value of e is normally obvious anyway, just look at the range of values we see
23:37:41 <ais523> I think I found a way to encode subset sum into this
23:37:48 <ais523> but I can't remember the details now
23:42:57 <int-e> oh, it takes input on stdin
23:43:13 <int-e> `` morse-decode <<<'...-- ....- -.-. ...--'
23:44:07 <HackEgo> 4683:2014-07-03 <FireFl̈y> ` gcc -x c -o bin/morse-decode - <<<\'c, v = 1; main() { while (c = getchar(), ~c) v = c < 33? putchar("& etianmsurwdkgohvf.l.pjbxcyzq..54.3.;!2).+...,16=/:..(.7.?_8.9o\\"...$...@...\'\\\'\'..-"[v < 64? (v != 40)*v : v % 51 + 33]), 1 : v * 2 + c % 2; }\'
23:49:42 <int-e> `` mv {bin,lib}/morse-decode; echo '#!/hackenv/bin/shebang_args_or_input /hackenv/lib/morse-decode' > bin/morse-decode; chmod +x bin/morse-decode
23:50:26 <int-e> `morse-decode ... --- ...
23:50:35 <int-e> `` morse-decode <<<'... --- ...'
23:53:44 <int-e> FireFly: I'm watching the infrastructure review. :P
23:54:22 <int-e> https://media.ccc.de/v/34c3-8911-34c3_infrastructure_review
23:55:02 * FireFly only attended a few sessions, should watch the talks that seemed interesting now
23:55:43 <int-e> hours and hours of fun and I wasn't even there.
23:56:23 <FireFly> it was a really nice environment
23:57:43 -!- oerjan has joined.