00:03:32 -!- JaBoJa|2 has changed nick to JaBoJa.
00:04:56 -!- Phantom__Hoover has quit (Read error: Connection reset by peer).
00:05:25 -!- Phantom__Hoover has joined.
00:20:32 -!- Jafet has joined.
00:23:17 -!- pikhq has quit (Ping timeout: 256 seconds).
01:00:38 -!- JaBoJa has quit (Read error: Connection reset by peer).
01:48:43 -!- augur has joined.
02:45:29 -!- IMEVER has joined.
02:48:36 -!- IMEVER has quit (Quit: Leaving.).
03:01:18 -!- Jafet has quit (Ping timeout: 264 seconds).
03:24:27 -!- Phantom__Hoover has quit (Read error: Connection reset by peer).
03:28:21 -!- copumpkin has joined.
04:02:50 -!- zzo38 has joined.
04:09:03 <zzo38> Finally I figured out how to beat the assassin in the Dungeons&Dragons game! I asked the referee what is phase of moon in the game; he asked me to select the phase of the moon instead, so I said it is a new moon and he accepted that.
04:10:36 <shachaf> You should've selected blue moon.
04:10:45 <shachaf> Or one & a half moons.
04:10:49 <shachaf> http://gallery.guetech.org/zork0/calendar11.jpg
04:10:55 <kmc> http://chainsawsuit.com/2012/08/07/cool-moon/
04:10:56 <zzo38> Is that a phase of the moon? I do not think it is valid.
04:10:57 <shachaf> http://gallery.guetech.org/zork0/calendar10.jpg
04:11:03 <zzo38> I have seen the Zork calendar already
04:11:05 <zzo38> I have a copy
04:11:10 <shachaf> http://gallery.guetech.org/zork0/calendar13.jpg
04:11:11 <shachaf> Oh.
04:11:21 <shachaf> zzo38: An actual original copy from the game?
04:11:46 -!- TeruFSX has quit (Ping timeout: 252 seconds).
04:17:18 <zzo38> shachaf: No, it is a picture I found on computer.
04:17:58 <shachaf> zzo38: Oh. I found a picture on computer too.
04:23:11 -!- aloril has quit (*.net *.split).
04:23:11 -!- quintopia has quit (*.net *.split).
04:23:12 -!- hogeyui_ has quit (*.net *.split).
04:28:26 -!- aloril has joined.
04:28:26 -!- quintopia has joined.
04:28:26 -!- hogeyui_ has joined.
04:32:10 -!- xiaoding has joined.
04:32:33 -!- xiaoding has left.
04:32:51 -!- xiaoding has joined.
04:32:59 -!- xiaoding has left.
04:37:19 -!- heroux has quit (Ping timeout: 252 seconds).
05:24:29 -!- kinoSi has quit (Read error: Connection reset by peer).
05:24:57 -!- kinoSi has joined.
05:26:27 <zzo38> In this basketball game on X-BIT, I managed to win 89 to 49 yesterday.
05:26:36 <zzo38> Usually it is not by that many points.
05:29:33 <zzo38> My team (Canada) plays at Raleigh tonight. Let's see... They have a better F than I do but I have a better C. (However, their best F is not in their starting lineup.)
05:31:35 <shachaf> 89 to 49? That's a lot of tos.
05:33:56 <zzo38> I have enough G but not enough F and C. I have only one PF, but I think F is also usable as PF and SF, and G is usable as PG and SG, but I think C can only use C, and in addition there are less C available to purchase, so this makes difficuly.
05:34:23 <shachaf> zzo38: You should acquire some R.
05:34:35 <zzo38> R? I don't think this game has those.
05:35:12 <zzo38> I think the team players are only classified as: G, PG, SG, F, PF, SF, and C.
05:48:23 <kmc> all of canada has one basketball team?
05:49:22 <shachaf> zzo38: Maybe some N, then?
05:49:45 <zzo38> kmc: I am sure that it is not the case. However, this is just a computer game.
05:49:57 <zzo38> shachaf: There is no N either, as far as I can see.
05:51:16 <shachaf> What about: E, TC, OP, O, Σ, ꙮ, VV, K, T, SF, JN, P, L, and U?
06:29:33 <zzo38> I already have SF
06:31:17 -!- copumpkin has quit (Ping timeout: 245 seconds).
06:31:20 * Sgeo is attempting to understand WTF an application server is
06:31:56 -!- copumpkin has joined.
06:38:10 -!- heroux has joined.
07:17:39 -!- oerjan has joined.
07:25:37 -!- nortti has quit (Ping timeout: 240 seconds).
07:32:50 -!- nortti has joined.
07:52:53 -!- zzo38 has quit (Remote host closed the connection).
08:01:46 -!- monqy has quit (Quit: hello).
08:18:44 -!- nooga has joined.
08:34:54 -!- ztirf has joined.
08:48:38 -!- MoALTz has joined.
08:57:29 <oerjan> > (0$0&&&)
08:57:31 <lambdabot>   The operator `Control.Arrow.&&&' [infixr 3] of a section
08:57:31 <lambdabot>      must have low...
08:57:32 <lambdabot> oerjan: You have 1 new message. '/msg lambdabot @messages' to read it.
08:57:45 <oerjan> @messages
08:57:46 <lambdabot> elliott asked 9h 38m 27s ago: that is literally the least motivating promise ever made. but i will look into it tonight
09:01:13 <fizzie> Those people and their misuse of @ask vs. @tell.
09:04:01 <oerjan> i think it's an inside joke.
09:05:18 <fizzie> Oh? In that case, ha ha, I laugh.
09:07:27 -!- heroux has quit (Ping timeout: 256 seconds).
09:09:03 -!- heroux has joined.
09:09:11 <oerjan> > (0$0`on`)
09:09:12 <lambdabot>   The operator `Data.Function.on' [infixl 0] of a section
09:09:12 <lambdabot>      must have lowe...
09:09:34 <fizzie> All you need is lowe.
09:14:03 <itidus21> stupid robut
09:14:42 <oerjan> itidus21: um it did just as expected...
09:15:18 <oerjan> i'm triggering that error message on purpose to see the [infixl 0] information
09:15:32 -!- heroux has quit (Ping timeout: 248 seconds).
09:15:58 <itidus21> "Brace yourselves gentlemen. According to the gas chromatograph, the secret ingredient is... Love!? Who's been screwing with this thing?"
09:16:20 -!- heroux has joined.
09:16:34 <oerjan> the bad thing about love is that it's so secret we cannot find it
09:18:04 <itidus21> its a quote from the simpsons when trying to determine an ingredient in some alcoholic cocktail
09:26:09 * Sgeo vaguely remembers actually seeing that episode.
09:27:30 <shachaf> fizzie: I only do it with a select few who can "appreciate" it.
09:29:42 <itidus21> Sgeo: the drink was called a flaming moe
09:48:35 -!- heroux has quit (Ping timeout: 244 seconds).
09:54:42 -!- MoALTz has quit (Ping timeout: 264 seconds).
10:50:28 -!- heroux has joined.
10:51:11 * oerjan learns there is a star named Zubenelgenubi
10:51:52 <fizzie> Sounds vaguely Lovecraftian.
10:51:52 <lambdabot> fizzie: You have 1 new message. '/msg lambdabot @messages' to read it.
10:52:18 <oerjan> apparently it means "the southern claw"
10:54:44 <fizzie> "Alpha Librae -- has the traditional name Zubenelgenubi" -- hey, Alpha Librae exists in Star Control 2.
10:55:00 <nortti> oerjan: in what language?
10:55:03 <fizzie> Beta Librae is the Supox homeworld, that's probably where I remember it from.
10:55:11 <oerjan> nortti: mangled arabic
10:55:11 <fizzie> nortti: "The name, from Arabic الزبن الجنوبي (al-zuban al-janūbiyy), means "southern claw" --"
10:57:43 -!- Phantom_Hoover has joined.
10:59:17 <fizzie> "The two brightest components of Alpha Librae form a double star -- The brightest member, α2 Librae, is itself a spectroscopic binary system. The second member, α1 Librae -- too is a spectroscopic binary -- The system may have a fifth component, the star KU Librae -- thus forming a hierarchical quintuple star system."
10:59:23 <fizzie> Sounds quite complicated.
10:59:46 <fizzie> All this for a dot on the night sky. Such wate.
10:59:48 <fizzie> Waste.
11:00:45 <Phantom_Hoover> It was deep up until 'wate'.
11:00:53 <Phantom_Hoover> That kind of ruined it.
11:02:28 <fizzie> Yes. :/
11:10:17 <itidus21> One small step for man, one giant heap for mankind. ^leap
11:13:19 -!- ztirf has quit (Ping timeout: 252 seconds).
11:13:56 <itidus21> i didnt really know the actual version had a typo.. but i  think have heard so before
11:14:42 <fizzie> I'm not sure it's called a "typo" when it's done by a person speaking.
11:15:05 -!- ztirf has joined.
11:15:06 <itidus21> well in this new age it won't be long before it is
11:17:02 -!- ztirf has quit (Client Quit).
11:19:53 -!- ogrom has joined.
11:29:56 -!- ion has quit (Ping timeout: 248 seconds).
11:32:23 <oerjan> > (`mod` 7) <$> [1055-1020, 211-176]
11:32:24 <lambdabot>   [0,0]
11:32:40 -!- ion has joined.
11:34:27 <oerjan> > 98-14
11:34:28 <lambdabot>   84
11:35:40 <oerjan> > (938+84, 290+84)
11:35:41 <lambdabot>   (1022,374)
11:36:36 <itidus21> > (2+0+0,0+00+2+0)
11:36:37 <lambdabot>   (2,2)
11:38:17 <itidus21> > (0.0+000+0+0,0+00+0+0+0)
11:38:19 <lambdabot>   (0.0,0)
11:39:14 <itidus21> > 0.0 > 0.000
11:39:15 <lambdabot>   False
11:39:52 <itidus21> > 0.0 < 0.000
11:39:53 <lambdabot>   False
11:40:05 <itidus21> > 0.0 equal 0.000
11:40:06 <lambdabot>   Not in scope: `equal'
11:40:15 <Deewiant> ==
11:40:24 <itidus21> > 0.0 == 0.000
11:40:26 <lambdabot>   True
11:40:31 <itidus21> thanks
11:40:48 <itidus21> using this information i was able to save the city once again
11:43:16 <oerjan> > (1054+84, 28+84)
11:43:17 <lambdabot>   (1138,112)
11:48:00 <fizzie> There was someone at ##c the other day confused why  float a = 3.141593; if (a < 3.141593) puts("low");  was always printing 'low'. (Example slightly simplified.)
11:48:28 <fizzie> Floating points sure are nasty.
11:50:12 <itidus21> > 52*50-42*10^5
11:50:13 <lambdabot>   -4197400
11:50:18 <itidus21> humm
11:50:35 <itidus21> > 52*50-42*(10^5)
11:50:36 <lambdabot>   -4197400
11:50:50 <itidus21> i suspect i did something wrong here
11:51:22 <fizzie> I have no clue what those numbers are for, but the result sure seems reasonable.
11:51:35 <itidus21> > 52*50-42*10^4
11:51:36 <lambdabot>   -417400
11:51:47 <itidus21> ngyang ngyang
11:52:20 <itidus21> > 42*10^4-52*50
11:52:21 <lambdabot>   417400
11:52:27 <itidus21> ahh
11:52:55 <oerjan> > (894+84, 246+84)
11:52:56 <lambdabot>   (978,330)
12:00:23 <itidus21> > 84 * 72 * 88 / 42 / 11 - 14
12:00:24 <lambdabot>   1138.0
12:02:44 <oerjan> > (`mod` 7) <$> [1055-849, 211-30]
12:02:45 <lambdabot>   [3,6]
12:03:14 <oerjan> > (`mod` 7) <$> [849-849, 128-30]
12:03:15 <lambdabot>   [0,0]
12:03:36 <fizzie> > exp(1)**pi - pi
12:03:37 <lambdabot>   19.99909997918947
12:03:47 <fizzie> Lambdabot must have that same floating-point bug xkcd mentions.
12:06:13 <itidus21> > chr . read <$> words "84 72 88 42 11 14"
12:06:16 <lambdabot>   "THX*\v\SO"
12:15:45 <oerjan> oh duh
12:16:03 <itidus21> that was terrible....
12:19:47 <itidus21> > 2600 x 42 / 52 / 50
12:19:48 <lambdabot>   1.0
12:19:56 <itidus21> humm
12:19:58 <fizzie> What's that 'x'? 
12:20:05 <itidus21> LOL
12:20:12 <itidus21> lol
12:20:46 <itidus21> > let 2x2 = 2*2 in 2600 x 42 / 52 / 50
12:20:47 <lambdabot>   <no location info>: Parse error in pattern
12:21:03 <oerjan> > (`mod` 7) <$> [869-850, 49-128]
12:21:04 <itidus21> humm.. now im just being dumb
12:21:04 <lambdabot>   [5,5]
12:21:19 <fizzie> I don't think "x" works as an operator, syntax-wise.
12:21:23 <itidus21> > 2600 * 42 / 52 / 50
12:21:24 <lambdabot>   42.0
12:21:47 <itidus21> > chr . read <$> words "52 50"
12:21:50 <lambdabot>   "42"
12:22:05 <fizzie> @type x
12:22:06 <lambdabot> Expr
12:22:19 <fizzie> Must be one of those "things" that bot has.
12:22:37 <itidus21> my things are stupid
12:22:52 <itidus21> the bots things are just common sense
12:24:40 <itidus21> so.. '4' * '2' * 42 = 2600... thats kind of cool
12:24:58 <itidus21> waitno it doesnt
12:25:06 <itidus21> oops
12:26:52 <itidus21> crawls back under my rock
12:27:25 <fizzie> '4' * '2' = 2600, though. I don't know how cool that is.
12:27:30 <fizzie> > product $ ord <$> "42"
12:27:31 <lambdabot>   2600
12:27:49 <itidus21> 2600 is pretty cool
12:28:08 <itidus21> but my thing isn't so much
12:28:54 <itidus21> hmm
12:29:19 <itidus21> what i would be interested in is a case where the text of a number is the same as the string of the number
12:29:34 <itidus21> by something like the product or the sum
12:30:18 <itidus21> ^oops
12:30:23 <itidus21> hewuihduiwehduiwehduw
12:30:28 <fizzie> > sum $ ord <$> "150"
12:30:29 <lambdabot>   150
12:30:35 <itidus21> nice
12:31:00 <fizzie> (49+53+48.)
12:31:23 <Deewiant> > filter (\n -> n == sum (map ord (show n))) [0..]
12:31:27 <lambdabot>   mueval-core: Time limit exceeded
12:31:36 <fizzie> Also 151, 152, ..., 159 for obvious reasons.
12:31:37 <Deewiant> > take 10 $ filter (\n -> n == sum (map ord (show n))) [0..]
12:31:38 <lambdabot>   [150,151,152,153,154,155,156,157,158,159]
12:32:10 <Deewiant> > filter (\n -> n == sum (map ord (show n))) [0..10^6]
12:32:14 <lambdabot>   [150,151,152,153,154,155,156,157,158,159]
12:32:16 <Deewiant> > filter (\n -> n == product (map ord (show n))) [0..10^6]
12:32:19 <lambdabot>   []
12:32:22 <itidus21> take 12 $ filter (\n -> n == sum (map ord (show n))) [0..]
12:32:30 <itidus21> > take 12 $ filter (\n -> n == sum (map ord (show n))) [0..]
12:32:33 <lambdabot>   mueval-core: Time limit exceeded
12:32:34 <fizzie> Apparently that's all, folks.
12:32:41 <itidus21> ooh
12:32:46 <itidus21> spooky
12:33:12 <itidus21> > take 10 $ filter (\n -> n == product (map ord (show n))) [0..]
12:33:16 <lambdabot>   mueval-core: Time limit exceeded
12:33:20 <fizzie> Given that the individual values are ~50, the product grows too quickly, while the sum of course grows too slowly.
12:33:31 <itidus21> did i write that right?
12:33:52 <Deewiant> Yes. (To both of you.)
12:33:53 <itidus21> oh you did it already
12:33:56 <itidus21> wow
12:37:08 <fizzie> > flip showHex "" <$> filter (\n -> n == sum (map ord (showHex n ""))) [0..10^5]
12:37:10 <lambdabot>   ["9a","9b","9c","9d","9e","9f"]
12:38:25 <fizzie> > flip showHex "" <$> filter (\n -> n == sum (map (ord . toUpper) (showHex n ""))) [0..10^5]
12:38:26 -!- ais523 has joined.
12:38:27 <lambdabot>   []
12:38:42 <fizzie> Aw. Though I suppose one could argue the "0x" prefix could also be counted in that.
12:39:13 <itidus21> > flip showHex "" <$> filter (\n -> n == product (map ord (showHex n ""))) [0..]
12:39:14 <lambdabot>   can't find file: L.hs
12:39:35 <itidus21> :-"
12:39:55 <itidus21> crawls back under my rock
12:41:13 <fizzie> That was some kind of unrelated breakage, I'd say.
13:02:05 <oerjan> bah there's a bug in the jolverine loop
13:02:13 -!- oerjan has quit (Quit: Will fix it later).
13:06:13 -!- boily has joined.
13:07:21 -!- ais523 has quit.
13:07:28 -!- ais523 has joined.
13:11:41 -!- ais523 has quit (Read error: Connection reset by peer).
13:11:47 -!- ais523_ has joined.
13:12:02 -!- ais523_ has quit (Client Quit).
13:16:59 -!- Arc_Koen has joined.
13:20:44 <Arc_Koen> hello
13:23:04 <mroman> `welcome Arc_Koen
13:23:14 <HackEgo> Arc_Koen: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page. (For the other kind of esoterica, try #esoteric on irc.dal.net.)
13:23:16 <Arc_Koen> how are things going?
13:24:21 <mroman> @type <$>
13:24:22 <lambdabot> parse error on input `<$>'
13:24:27 <mroman> @type (<$>)
13:24:28 <lambdabot> forall a b (f :: * -> *). (Functor f) => (a -> b) -> f a -> f b
13:25:01 <fizzie> @src (<$>)
13:25:01 <lambdabot> f <$> a = fmap f a
13:25:08 -!- ais523 has joined.
13:25:08 <fizzie> It's just that.
13:25:16 <mroman> Yeah.
13:43:53 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
13:59:19 <kmc> > let (×) = (*) in 2600 × 42 / 52 / 50
13:59:20 <lambdabot>   42.0
14:00:32 -!- ais523_ has joined.
14:00:52 <fizzie> Well, if you go all *fancy* with your x's.
14:01:22 -!- ais523 has quit (Read error: Connection reset by peer).
14:04:02 -!- copumpkin has joined.
14:26:07 -!- ogrom has quit (Quit: Left).
14:27:38 <kmc> http://news.bbcimg.co.uk/media/images/62959000/jpg/_62959824_hacked.jpg
14:35:06 <itidus21>  :O
14:36:38 <copumpkin> whoa, I'm not sure my CPU would be able to decode binary with that in it
14:36:43 <copumpkin> is that why it's a hack?
14:39:46 -!- ais523__ has joined.
14:39:48 <itidus21> HACKED is embedded in the bitstream in bitmap space, perhaps
14:42:45 <copumpkin> whoaaaa
14:42:48 -!- ais523_ has quit (Ping timeout: 252 seconds).
14:42:49 <copumpkin> that sounds really advanced
14:43:04 <copumpkin> itidus21: r u hax0r?
14:43:13 <copumpkin> lrn me hax kthx
14:45:50 <itidus21> `? hackego
14:45:54 <HackEgo> HackEgo, also known as HackBot, is a bot that runs arbitrary commands on Unix. See `help for info on using it. You should totally try to hax0r it! Make sure you imagine it's running as root with no sandboxing.
14:50:09 -!- AnotherTest has joined.
14:50:21 <AnotherTest> hello
14:57:16 <boily> hi.
14:58:01 -!- ais523__ has quit.
14:59:57 -!- Arc_Koen has quit (Quit: that's dr. turing to you, punk).
15:01:45 -!- function has changed nick to variable.
15:12:37 <kmc> as far as collision resistance goes, how much worse is "first half of sha256 hash" compared to "both halves of sha256 hash xored together"?
15:13:43 <kmc> i think it shouldn't matter for an ideal hash, but might make life easier for an attacker exploiting some cryptographic weakness of sha256
15:14:01 <copumpkin> well, I don't think we have any knowledge of sha256 being any worse than ideal
15:14:03 <copumpkin> so it should be the same
15:14:13 <kmc> maybe you don't *puts on NSA sunglasses*
15:14:16 <copumpkin> lol
15:14:27 <kmc> so how's it going copumpkin
15:14:35 <copumpkin> xoring them together might be very slightly more future-proof in case someone finds some bug in the first or second half :P
15:14:39 <copumpkin> but that seems unlikely
15:14:48 <copumpkin> not too badly
15:14:58 <copumpkin> you missed out on a great talk by edwardk yesterday
15:15:28 <kmc> aw
15:15:35 <kmc> i should pay more attention to these things
15:15:56 <copumpkin> you don't love haskell anymore :(
15:16:00 <copumpkin> *wub
15:16:09 <kmc> :(
15:16:13 <kmc> (not actually true)
15:18:26 -!- MoALTz has joined.
15:26:32 -!- ogrom has joined.
15:33:27 <shachaf> kmc: What are you doing with the first half of sha256? Human-readable identifiers?
15:33:55 <kmc> no
15:34:03 <kmc> long and boring story
15:34:04 <fizzie> Truncation at least is a thing that I've seen done somewhere for SHA-256. (And SHA-224 of course is a truncated SHA-256.)
15:34:55 <kmc> speaking of which, how about a protocol which converts a large number of arbitrary bits into a human readable story
15:35:11 * shachaf wonders whether there's anything more to be confident about with some function that takes an explicit output length, like PBKDF2, than just truncating/xoring a hash.
15:35:26 <shachaf> kmc: Human-memorizable, in particular?
15:35:27 <kmc> and a standard for parsing this which is insensitive to whitespace, punctuation, and unimportant words
15:35:30 <kmc> yes
15:35:35 <kmc> so that you can memorize, say, an entire RSA private key
15:36:06 <kmc> this is an extension of the "four random words" approach to passwords
15:36:14 <shachaf> I've talked about that a couple of times before in other channels.
15:36:19 <kmc> cool
15:36:38 <kmc> what did you conclude
15:37:21 <shachaf> I think someone in another channel had a thing where he split his password into a few bits and then found words in /usr/share/dict/words whose md5sums ended with those bits, or some scheme like that.
15:38:03 <shachaf> I concluded that 2048 is an awful lot of bits. :-(
15:38:28 <kmc> yeah
15:38:43 <shachaf> You would probably want some error-correcting codes or something too.
15:38:48 <kmc> yeah
15:38:54 <kmc> fuck yeah, error correcting codes
15:39:43 <shachaf> On the other hand people manage to memorize some pretty large texts, so it's probably feasible.
15:40:01 <fizzie> [Insert world record of pi memorization result here.]
15:40:24 <kmc> i think you could probably write a paper on this
15:40:37 <kmc> well, i'm not so interested in world record capabilities ;)
15:40:40 <shachaf> There are approaches to memorizing numbers like https://en.wikipedia.org/wiki/Mnemonic_major_system which have a fair amount of redundancy and let you make up your own sentences.
15:40:52 <AnotherTest> shachaf: text (sentences) is easier to memorize I would say than pseudo-random bytes
15:41:00 <shachaf> (But don't work that well in certain edge cases.)
15:41:23 <shachaf> AnotherTest: Yes, but it doesn't have nearly as many bits per character.
15:41:31 <AnotherTest> "For most people it would be easier to remember 3.1415927 (the number known as pi) as:"
15:41:34 <AnotherTest> that's wrong
15:41:42 <kmc> my (unjustified) assumption is that the structure of a story makes it easier to remember stuff, even though it adds to the length of the text you're memorizing
15:41:49 <shachaf> AnotherTest: That's not the number known as pi. Are you some kind of physicist?
15:41:50 <AnotherTest> well for me it is
15:42:00 <kmc> especially if it's done in such a way that you don't have to remember the connective bits of the story correctly
15:42:07 <shachaf> I wonder whether rhymes would help or hurt.
15:42:14 <AnotherTest> help
15:42:16 <kmc> heh
15:42:23 <kmc> you get fewer bits though
15:42:32 <shachaf> Right, that's the "hurt" part.
15:42:43 <kmc> we should invent a protocol which converts binary blobs into a sequence of dirty limericks
15:42:49 <shachaf> I wonder what the entropy of rhyming text is.
15:42:52 <AnotherTest> shachaf: that was a wikipedia quote by the way
15:43:04 <shachaf> I,I http://en.wikipedia.org/wiki/The_Complexity_of_Songs
15:44:50 <shachaf> If you're trying to memorize 2048 bits you're probably going to get some pretty bad edge cases for whatever scheme you use...
15:48:41 <shachaf> I should come up with a scheme for this and memorize my private keys!
15:48:47 <shachaf> That way the NSA has more to torture out of me.
15:49:59 <AnotherTest> I heard of this technique where you had to visualize numbers and put them in a "story"
15:50:08 <AnotherTest> I have however not actually tried it out
15:51:12 <AnotherTest> M. Tullius Cicero also did this(historians claim)
15:51:12 <shachaf> kmc: http://csrc.nist.gov/groups/ST/hash/documents/Kelsey_Truncation.pdf
15:57:41 <shachaf> kmc: http://csrc.nist.gov/publications/drafts/800-107/Draft_Revised_SP800-107.pdf
16:06:41 -!- MoALTz_ has joined.
16:08:54 -!- FreeFull has joined.
16:09:17 -!- MoALTz has quit (Ping timeout: 246 seconds).
16:11:52 -!- augur has quit (Remote host closed the connection).
16:12:18 -!- augur has joined.
16:13:07 -!- augur has quit (Read error: Connection reset by peer).
16:13:11 -!- augur_ has joined.
16:13:40 -!- augur_ has quit (Read error: Connection reset by peer).
16:14:04 -!- augur has joined.
16:18:25 -!- augur has quit (Ping timeout: 260 seconds).
16:23:26 -!- nvt has quit (Ping timeout: 268 seconds).
16:26:37 -!- carado has joined.
16:39:19 -!- MoALTz_ has quit (Quit: Leaving).
16:40:10 -!- nvt has joined.
16:50:01 -!- augur has joined.
17:19:34 -!- atriq has joined.
17:20:29 <kmc> so one simple approach is to pick a set of "interesting" words and extract the information from the unique "interesting" words in order of first appearance
17:20:40 <atriq> @messages?
17:20:40 <lambdabot> Sorry, no messages today.
17:20:43 <atriq> Yay
17:21:26 <kmc> i don't know how big is reasonable for a list of interesting words that aren't too similar, i.e. excluding plurals and such
17:21:31 <kmc> let's say 14 bits
17:22:19 <kmc> then to encode a 2048 bit key, you need a story with about 150 unique interesting words
17:23:42 <atriq> Hmm
17:23:52 <atriq> Am I famous enough to have a page for myself on the wiki?
17:24:34 <atriq> ...
17:24:38 <atriq> I don't think I am
17:25:23 <kmc> but instead you could use the choice of unique words together with the pattern in which they are repeated
17:25:24 <shachaf> 14 bits per word?
17:25:38 <kmc> yeah, i.e. a dictionary of 16,384 interesting words
17:26:33 <shachaf> Seems reasonable.
17:26:43 <kmc> for english anyway
17:26:46 <kmc> english has a ton of words
17:26:49 <shachaf> This requires you to always have access to the wordlist, which I guess isn't so bad.
17:27:19 <kmc> yeah, i am not trying to design a scheme that anyone can implement from memory
17:27:23 <kmc> perhaps that would be more valuable though
17:27:49 <shachaf> Probably valuable enough to come up with one standardized scheme and get it everywhere.
17:30:41 <shachaf> There's serious diminishing returns to having a larger word file.
17:30:59 <shachaf> 13/12 bits would mean that you'd need 160/170 words instead of 150.
17:34:17 -!- ztirf has joined.
17:39:46 -!- ztirf has quit (Quit: Nettalk6 - www.ntalk.de).
17:45:23 -!- glogbackup has joined.
18:04:44 -!- augur has quit (Remote host closed the connection).
18:12:54 -!- augur has joined.
18:28:00 -!- Nisstyre-laptop has quit (Ping timeout: 268 seconds).
18:28:24 -!- monqy has joined.
18:32:11 -!- nortti has changed nick to []{}\|-_`^.
18:33:40 -!- []{}\|-_`^ has changed nick to nortti.
18:35:23 <kmc> ÄÅäåÖö-_`^
18:39:52 <shachaf> «»“”¬¦¥¼
18:40:24 <shachaf> kmc: You should figure out and implement that memorization thing so I can use it!
18:40:49 <kmc> perhaps
18:44:49 -!- EgoBot has quit (Ping timeout: 272 seconds).
18:44:56 -!- HackEgo has quit (Remote host closed the connection).
18:46:41 -!- EgoBot has joined.
18:47:00 -!- Gregor has quit (Ping timeout: 252 seconds).
18:47:05 -!- HackEgo has joined.
18:50:43 -!- Gregor has joined.
18:54:08 -!- AnotherTest has quit (Quit: Leaving.).
19:09:07 -!- ztirf has joined.
19:15:37 -!- ogrom has quit (Quit: Left).
19:31:28 -!- ztirf has quit (Quit: Nettalk6 - www.ntalk.de).
19:58:44 -!- oerjan has joined.
20:27:03 -!- zzo38 has joined.
20:30:07 -!- boily has quit (Quit: Poulet!).
20:32:02 -!- Vorpal has joined.
20:33:48 <oerjan> ho hum
20:49:34 <Sgeo> I should try to get emacs and nrepl.el working nicely on my system
20:50:19 <Sgeo> Or maybe ritz?
20:58:11 <olsner> oerjan: ho hum vår sång är dum?
20:58:57 * oerjan doesn't know that one
21:01:03 <olsner> http://www.youtube.com/watch?v=nSgngZ9CpTM
21:02:09 <olsner> seems to be "hei hå" or something in norwegian
21:04:13 <oerjan> sorry, it's late in the evening and i won't disturb the silence...
21:05:01 <olsner> you should enable on-demand plugins
21:05:19 <olsner> oh, but you're not using Opera, maybe your browser doesn't have that
21:06:17 * oerjan has no idea what you're talking about
21:06:57 <olsner> it's a thing where plugins never start playing (or even downloading) until you allow it
21:07:25 <nortti> olsner: is it like konquerors load plugins only when specified?
21:07:42 <olsner> nortti: sounds similar, but I've never used konquerors
21:07:47 <oerjan> ...how is that relevant?  my speakers are off by default, anyway
21:08:35 <nortti> olsner: you should try. it isn't best on the stadards front but it is fast and powerful and you can integrate almost anything into it
21:08:36 <olsner> ok, sounded like you couldn't safely follow the link
21:09:14 <oerjan> i assume that's a link to a song, so it would be pointless to follow it when i'm not going to put on sound
21:09:53 <olsner> even without sound you can tell what song it was from either of the name or the video
21:10:33 <olsner> not important, I just linked to that because I used youtube to figure out what the proper name was and to confirm it was the song I was thinking about
21:10:44 <shachaf> kmc: °͜°
21:10:48 <oerjan> oh it's that scene
21:11:08 <olsner> indeed
21:19:22 -!- atriq has quit (Ping timeout: 244 seconds).
21:21:56 -!- JaBoJa has joined.
21:25:30 -!- kinoSi has quit (Read error: Connection reset by peer).
21:25:57 -!- kinoSi has joined.
21:30:09 -!- NihilistDandy has joined.
21:36:16 -!- JaBoJa|2 has joined.
21:36:54 <zzo38> Yesterday at FreeGeek I had some .NSF musics to play, they said try Rhythmbox, so I tried and yes it can play .NSF musics, although the expansions may not work perfectly.
21:39:05 -!- JaBoJa has quit (Ping timeout: 265 seconds).
21:39:07 -!- JaBoJa|2 has changed nick to jaboja.
21:54:54 -!- zzo38 has quit (Ping timeout: 240 seconds).
21:55:18 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
22:04:09 -!- Nisstyre-laptop has joined.
22:04:40 -!- augur has quit (Remote host closed the connection).
22:13:30 -!- zzo38 has joined.
22:16:43 -!- pumpkin has joined.
22:16:46 -!- copumpkin has joined.
22:17:05 -!- pumpkin has changed nick to Guest56942.
22:18:12 -!- zzo38 has quit (Remote host closed the connection).
22:18:13 -!- Guest56942 has quit (Client Quit).
22:25:34 -!- zzo38 has joined.
22:29:56 <jaboja> Does anybody ever tried to create an esoteric charset?
22:30:55 <shachaf> Every charset is esoteric.
22:31:24 <olsner> if you're unsatisfied with the common ones, there's also EBCDIC
22:32:22 <olsner> "solved problem, move along" :P
22:42:12 -!- augur has joined.
22:50:42 -!- nooga has quit (Ping timeout: 268 seconds).
22:53:24 -!- Vorpal has quit (Ping timeout: 276 seconds).
22:54:01 -!- monqy has quit (Quit: hello).
22:54:16 <Phantom_Hoover> shachaf, they totally are!
22:54:32 <shachaf> Phantom_Hoover: Who totally are?
22:54:35 <Phantom_Hoover> I mean seriously, why did ascii have \, | and ~?
22:54:52 <Phantom_Hoover> Oh, and `.
22:55:10 <shachaf> \, is a terrible character.
22:55:15 <shachaf> ~? and `. are also terrible.
22:55:18 <shachaf> I mean, they're double-width!
22:55:22 <Phantom_Hoover> -_-
22:56:16 <NihilistDandy> This explains so much. 😼
22:56:39 <oerjan> much, but wrongly
22:57:03 <oerjan> MVLTE SED ERRANTER
22:58:34 <NihilistDandy> I don't know about that erranter
22:59:07 <NihilistDandy> I'd probably go with falso
22:59:17 <NihilistDandy> perperam, maybe
23:01:12 <olsner> erranter falso perperam
23:02:56 <jaboja> EBCDIC is interesting... Internet Explorer understands it, but Firefoks and Chrome don't.
23:04:50 <olsner> I'm surprised IE supports it, is it even possible to write HTML in ebcdic?
23:04:59 <Phantom_Hoover> the one standard ie supports
23:06:11 <olsner> hmm... I suppose if the http headers specify the charset, it's no problem to decode the ebcdic before sending it on to the HTML stuff
23:06:24 <Sgeo> I accidentally flooded #clojure
23:06:32 <olsner> good work
23:06:34 <Sgeo> Turns out the bot will gladly loop forever printing stuff
23:07:40 <Sgeo> Well, not "forever"
23:08:08 <olsner> only until it gets kicked?
23:08:32 <Sgeo> It was doing the side-effects to realize the first 32 elements
23:08:44 <Sgeo> Since I mapped a side-effecting function onto an infinite lazy seq
23:08:51 -!- TeruFSX has joined.
23:09:03 <olsner> I hope you derided them for having side-effects in their language
23:09:19 <olsner> "this wouldn't have happened in Haskell!"
23:11:36 <jaboja> http://jagiello.vot.pl/ebcdic.php
23:11:43 <jaboja> (IE only)
23:12:51 <jaboja> PHP used to send correct charset via HTTP (setting it only via meta tag does not force IE to parse it as EBCDIC)
23:13:02 <olsner> aww, opera doesn't have ebcdic
23:13:32 <Gregor> I suspect that as many as two people in this channel intentionally use IE, and maybe about seven total have it available.
23:16:25 -!- NihilistDandy has quit (Quit: Computer has gone to sleep.).
23:18:38 <zzo38> EBCDIC is not very good. ASCII is better. However, different thing, other character sets might works better. Also, if I designed ASCII the order would differ a bit, such as having 'A' after '9' so that you can write hexadecimal numbers.
23:21:23 <zzo38> I plan to make the FCHDL (Famicom Hardware Description Language) which is a Haskell library which can compile a Famicom mapper code in DotFami .cart format.
23:24:47 <oerjan> <NihilistDandy> I'd probably go with falso <-- but that would be less meta
23:25:25 <zzo38> What would you do if it was your job to design the 7-bit ASCII code including orders?
23:25:34 <oerjan> quit.
23:26:13 <zzo38> Do you not like to make up the ASCII?
23:28:03 -!- monqy has joined.
23:29:46 -!- NihilistDandy has joined.
23:57:22 <zzo38> How can you detect open bus in software? I want to be able to design a computer and have it detect whether or not anything is connected to the external memory port, if you push START (or use auto-start mode) to check the optical disc, external memory, etc to see if there is any program to load. But there is another possibility: The external memory does not necessarily have to be an executable program