00:00:16 <oerjan> hm one definition of equivalence could be: there exists at least one tape length, such that for both relative polarities of the tested programs, there exists a counterprogram that can get different outcome from the test programs.
00:01:01 <oerjan> the polarity part is because we might want flipped polarities not to change equivalence
00:02:43 <oerjan> this would be a non-trivial equivalence, of course.
00:05:54 <oerjan> if you can get a counterprogram that distinguishes between the two test programs and then reaches their IP before they have a chance to ensure win or suicide, then i suspect it can force different outcomes.
00:12:01 -!- Bicyclidine has joined.
00:12:40 <oerjan> <ais523> you need 768 to allow for all possible defence programs <-- hm i think that's fewer than i need?
00:17:35 <oerjan> although i didn't try to minimize it
00:18:01 <HackEgo> [wiki] [[FALSE]] http://esolangs.org/w/index.php?diff=40542&oldid=34791 * 77.181.84.57 * (+122) External resources: add cksum implemtation
00:18:26 <oerjan> am i reading the quantifiers in his claim wrong
00:19:08 <oerjan> i think he's solving a different problem
00:19:18 <boily> > 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 3
00:19:45 <oerjan> ok then my result is stronger i think
00:20:11 <boily> yup. insanely bored.
00:20:36 <oerjan> i think i can at least halve that
00:21:08 <oerjan> you need to beat his program on only one polarity and tape length
00:21:35 <oerjan> nah maybe that _is_ about the right order of magnitude
00:29:13 <boily> fungot: is it magnitudinally correct?
00:29:14 <fungot> boily: fnord o'malley tells of devil-worship with box found in the shrine on the alert, is poignantly visible in every line of the fnord, and such is my knowledge that i am safe? those powers survive the life of the physical frame. her crowning rage, however, the syracusans obtained after a while, for my thoughts were still far from settled, but i produced an electric pocket lamp and viewed the crowning fnord as it was
00:29:40 <boily> oerjan: only if you worship the devil. (which, considered that it pertains to a bf joust, could be quite useful.)
00:37:11 <oerjan> a lovely crafted estimate
00:42:55 <oerjan> @tell fizzie <fizzie> Fun fact about the Markov scoring, as pointed out by quintopia: if you do write the perfect (in terms of rest of the hill) program, all other programs will get a flat 0 as a score. <-- hm if there _are_ programs getting a flat 0, then they must lose perfectly against all that don't. so you could rerun the 0's as a second tier or something.
00:45:16 <lambdabot> 1606938044258990275541962092341162602522202993782792835301376
00:56:40 <boily> hm. (^) is infixr...
00:56:53 <boily> > 2 ^ 2 ^ 2 ^ 2 ^ 2 ^ 2 ^ 2
00:57:11 <boily> YES! another bot with cryptic error messages!
00:57:26 <boily> Bicyclidine: I couldn't remember.
00:57:48 <Bicyclidine> well, it is. of course if you need to worry about that you may have scary issues
00:58:08 <elliott_> oerjan: my defn of equivalence is p === q = forall r polarity 10<=tapelen<=30. trace(p,r,polarity,tapelen) = trace(q,r,polarity,tapelen)
00:58:18 <elliott_> where trace is limited to the 100k.
00:58:49 <elliott_> I guess you actually want to omit polarity there
00:58:57 <boily> Bicyclidine: my issues aren't scary. unless you are mentioning redmine issues, in which case I may suddenly twitche and have uncontrollable urges to mapole somebody.
00:59:16 <elliott_> oerjan: though then you have the weird thing where you erase the polarity but not the tape lengths
00:59:18 <Bicyclidine> boily: whatreya doin wi nested exponentials then?
00:59:36 <elliott_> oerjan: (as opposed to only considering warrior vs. warrior all-tape-lengths-and-polarities results, which seems obviously too coarse-grained)
00:59:49 <boily> Bicyclidine: exploring large numbers.
00:59:50 <oerjan> elliott_: is trace the exact list of commands the warriors execute?
01:00:00 <elliott_> note that for tail representation, (>)*30p = (>)*30q forall p, q
01:00:11 <elliott_> as in, the neverending ] representation
01:00:22 <boily> (I wonder if powers of two are normal...)
01:00:26 <elliott_> so there's lots of subtleties there.
01:00:38 <oerjan> elliott_: what exactly is trace
01:00:55 <elliott_> oerjan: I was thinking it'd just be the tape + tape pointers + flag count for each step
01:01:32 <elliott_> maybe you should include the instructions executed to differentiate ] and . in some cases, but conjecturally you can always pick r to distinguish those anyway?
01:01:36 <Bicyclidine> boily: iirc the end digits are constant after a while
01:01:53 <Bicyclidine> something to do with modular arithmetic, which i'm not nearly smart enough for
01:01:53 <oerjan> elliott_: oh. so ignoring the difference between [].
01:02:06 <oerjan> but everything else counts
01:02:24 <elliott_> oerjan: inside the quantifier... I think the forall r is generic enough that it'd catch a q that "fakes" p's loops?
01:02:36 <elliott_> because it has to fake the loop structure for every possible r.
01:02:42 <elliott_> which amounts to actually doing the loops.
01:03:03 <elliott_> also, I'm waving my hands really fast right now!!
01:03:04 <boily> Bicyclidine: I'll be putting that in my todo backlog list.
01:03:16 <boily> (that refering to modular arithmetic.)
01:04:07 <Bicyclidine> it's why you can get graham's number digits from the right.
01:04:12 <elliott_> oerjan: how about this? p === q = forall hill. add(p,hill) = add(q,hill) (note: hills contain exact points/scoring numbers)
01:04:22 <Bicyclidine> http://en.wikipedia.org/wiki/Graham%27s_number#Rightmost_decimal_digits right ok.
01:04:45 <elliott_> oerjan: that captures exactly what you want for a hill of all programs
01:06:34 <oerjan> i think my brain just turned off
01:07:34 <elliott_> I guess you can determine some things about the scoring property of the ur-hill using your beat-any-program programs
01:07:43 <oerjan> but before it turned off because you changed the definition again, i was going to say that you can only distinguish [] from . after a sufficent number of steps that r can possibly have reached your IP
01:08:12 <elliott_> I sort of feel like [] and . really are equivalent there though
01:08:16 <elliott_> since the results are "constant"?
01:08:31 <oerjan> oh and that the cell can possibly be either 0 or nonzero
01:08:36 <elliott_> a bf joust program starting [>] might as well be a bf joust program starting .>.
01:08:58 <elliott_> there'd certainly be no point having both on the same hill
01:11:11 <elliott_> so I think (forall hill. add(p,hill) = add(q,hill)) is equivalent to (forall r tapelen. exists polarity. winner(p,r,sieve,tapelen) = winner(q,r,polarity,tapelen)), which quantifies over the polarity and tapelen like you intended to.
01:12:34 <elliott_> I suppose you could get the exact same points/score by having it win the same number of matches but in a *different* pattern of tape lengths, since they're treated as unordered (like polarities), making the former different for reasons other than polarity, but presumably when quantifying over all hills (this is where my brain turns off too)
01:12:43 <elliott_> if it was even running in the first place.
01:13:35 <elliott_> yeah, my reaction too at this point.
01:14:04 <elliott_> here's my revised opinion: I knows an equivalent program when I sees it.
01:15:51 -!- boily has quit (Quit: RAINBOW CHICKEN).
01:19:22 -!- shikhin has joined.
01:20:27 <oerjan> you cannot catch rainbow chicken
01:20:37 <quintopia> oerjan: that's a good idea. if it's possible to write a perfect program, and who knows if it is, it would at least give a score. however, given that it's so unlikely to happen, is it really worth implementing?
01:22:29 -!- shikhout has quit (Ping timeout: 260 seconds).
01:23:19 <elliott_> I would bet money you can write a program that beats everything currently on the hill.
01:24:06 -!- Lorenzo64 has quit (Ping timeout: 258 seconds).
01:28:33 -!- Sorella has quit (Remote host closed the connection).
01:32:47 <quintopia> elliott_: yes, but the only idea i have for such a thing would be that a single minor tweak to any other program would topple the whole edifice
01:33:40 <elliott_> anyway, it might not be possible
01:34:03 -!- Sorella has joined.
01:34:12 <elliott_> you might have to do a different thing at time t depending on whether the other program is p or q, and you may not have enough time to gather enough information to distinguish them and branch on that before you have to
01:34:52 -!- Sorella has quit (Changing host).
01:34:53 -!- Sorella has joined.
01:38:29 <quintopia> elliott_: it could be even worse. there could be a single program which you have to treat completely differently depending on the tape length, but which makes it extremely difficult to guess what the length is, for instance by having lots of flag-sized decoys adjacent to the flag. no way to tell whether you're on the flag or not until you've cleared it, and if they're smart, maybe not even then.
01:39:02 <elliott_> quintopia: my religion holds that for any program p there is a p' that beats it on all tape lengths and polarities.
01:39:18 <quintopia> for instance, how do you tell the difference between a clever on-flag lock and ais523.preparation's lock?
01:39:41 <elliott_> basically you are claiming that unbeatable programs exist
01:40:22 <elliott_> what I no longer believe is that for any set of programs {p_0,p_1,...,p_n} there is a p' that beats all p_n on all tape lengths and polarities. that's significantly stronger
01:44:15 <oerjan> > length "48 characters should be enough for everyone."
01:46:34 <oerjan> indeed there is not necessarily a p' that beats all p_n on a _particular_ tape length and polarity.
01:52:10 -!- Bicyclidine has quit (Ping timeout: 250 seconds).
01:57:47 <quintopia> i am not claiming that unbeatable programs exist. i am saying i see no proof that it is impossible to write a program such that it is guaranteed to win in at leaaast one configuration. perhaps it isn't, but i see no proof.
01:59:09 <oerjan> proof: no program wins against a duplicate of itself, ever.
02:00:06 <quintopia> oerjan: i mispoke. i meant "not lose" instead of "win"
02:00:37 -!- shikhin has quit (Ping timeout: 245 seconds).
02:01:18 <oerjan> hm can you write a length 10 rush that is guaranteed to never lose
02:02:04 <oerjan> (on length 10, naturally)
02:02:12 <quintopia> consider the same rush using a reverse offset clear
02:02:42 <oerjan> um i don't know the bfjoust terms very well.
02:03:00 <quintopia> one clears around 128 and up. one clears around 0 and up.
02:03:21 <oerjan> s/very well/much at all/
02:04:45 <quintopia> for every rush there is a lock. let's leave it at that.
02:05:12 <oerjan> basically what i mean is, since you can assume the tape length is known, you can at least ignore all other cells than your own flag and the opponent's.
02:05:19 <quintopia> (it's impossible to write a program unbeatable on a *paritcular* configuration)
02:05:44 <quintopia> well, you would have to use the unknownness of the polarity to your advantage
02:06:00 <elliott_> oerjan: how can it win against both fastrush and +fastrush?
02:06:02 <oerjan> i proved that myself earlier, duh
02:07:03 <quintopia> elliott_: it doesn't have to win. it just has to draw.
02:08:00 <elliott_> if you have perfectlength10rush, then perfectlength10rush draws it, and +perfectlength10rush should beat it?
02:08:38 <elliott_> I'm too tired for this. goodnight!
02:12:05 <quintopia> so did anything interesting happen this evening?
02:15:27 <quintopia> isn't it about time the wiki had a new featured language
02:17:20 -!- Sorella has quit (Remote host closed the connection).
02:27:13 <Lymia> Realize my current project is a program whose input is all the programs on the hill, and the output is a single program, right?
02:27:27 <Bike> i realize nothing.
02:30:30 <oerjan> <ais523> (basically, I used an automated system to delete codepaths from it that weren't used against any of the programs on the hill) <-- that sounds relevant to your project
02:30:55 <oerjan> if you did that, you might get an exponential program down to reasonable size, no?
02:31:39 <oerjan> after all, you have at most 22*47 opponent configurations
02:32:41 <oerjan> and that then is also the maximal number of branchings
02:33:12 <oerjan> ok 103 Mb is still above the current limit :P
02:34:52 <oerjan> any compression of the 100000 steps that _doesn't_ contain a possible branch should still be compressible
02:37:02 <oerjan> of course doing it this way will probably cause crash and burn against any new program, but i assume you've considered that already.
02:38:46 <oerjan> this could be used to compile down my nested ({}) structure which the bot didn't seem to support, i think
02:45:36 -!- conehead has quit (Quit: Computer has gone to sleep).
02:50:20 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)).
03:08:34 <Lymia> oerjan, I'd need a large coprus of programs not on the hill
03:08:50 <Lymia> And switch to, say, monolith's clear loop.
03:13:00 <oerjan> Lymia: um the idea of deleting codepaths only works if you are willing to ignore all opponents not on the hill.
03:13:57 <Lymia> Deleting all code paths... relative to wht?
03:17:20 <oerjan> Lymia: relative to the hill you are trying to beat
03:17:55 <oerjan> mind you this is probably not _that_ relevant if you are autogenerating a program to beat it.
03:18:49 <oerjan> unless you make it out of parts of other programs, frankenstein-like. hm...
03:19:20 <Lymia> Deleting code paths from what?
03:21:08 <oerjan> if you are somehow generating a program that is over the size limit
03:21:31 <oerjan> but you only want to beat those 22*47 configurations that are on the hill already
03:21:45 <oerjan> then you can delete the code paths that none of them hit.
03:22:30 <oerjan> and with some luck the remainder might fit under the limit
03:30:06 <Lymia> quintopia, I had had it, like, a year ago
03:30:12 <Lymia> And gave up because I couldn't get my interpreter working right
03:31:10 <quintopia> i had it two years ago, but never had the gumption
03:31:34 <quintopia> so go ahead. have fun. hope you succeed.
03:32:16 <Lymia> I believe the fact that we had the same idea then could be because we talked about it in ancient times.
03:37:25 <oerjan> _or_ maybe you had a cloning accident and were really the same person.
04:23:53 <Sgeo> https://www.youtube.com/watch?v=qlPehnPkG8o "Norse theme" had some sounds that sounds vaguely Celtic. I don't know enough to know if it's a coincidence
04:23:59 <Sgeo> Norse-Celtic did get some hits in Google
04:24:12 <Sgeo> http://en.wikipedia.org/wiki/Norse%E2%80%93Gaels
04:25:42 -!- idris-bot has quit (Ping timeout: 245 seconds).
04:26:02 -!- Melvar has quit (Ping timeout: 245 seconds).
04:29:01 -!- conehead has joined.
05:30:13 <Sgeo> "Searching for toothpaste in eye? Kelley blue book"
05:30:22 <Sgeo> Apparently getting toothpaste in your eye is a used car
05:54:18 -!- MoALTz_ has joined.
05:57:17 -!- MoALTz has quit (Ping timeout: 245 seconds).
05:57:52 -!- MoALTz__ has joined.
06:01:29 -!- MoALTz_ has quit (Ping timeout: 260 seconds).
06:27:38 -!- ion has quit (Excess Flood).
06:27:46 -!- MoALTz__ has quit (Quit: Leaving).
06:29:22 -!- weissschloss has quit (Remote host closed the connection).
06:29:23 -!- paul2520 has quit (Ping timeout: 240 seconds).
06:29:48 -!- ion has joined.
06:29:53 -!- paul2520 has joined.
06:30:14 -!- paul2520 has changed nick to Guest82163.
06:30:40 -!- weissschloss has joined.
07:05:38 -!- oerjan has quit (Quit: nǫ́tt).
07:12:45 -!- conehead has quit (Quit: Computer has gone to sleep).
07:15:38 -!- weissschloss has quit (Write error: Broken pipe).
07:18:35 -!- weissschloss has joined.
07:21:52 -!- vyv has quit (Ping timeout: 240 seconds).
07:24:08 -!- vyv has joined.
08:10:49 -!- sebbu has quit (Ping timeout: 260 seconds).
08:30:47 -!- Patashu has joined.
08:34:23 -!- sebbu has joined.
08:35:03 -!- sebbu has quit (Changing host).
08:35:03 -!- sebbu has joined.
08:41:38 -!- drdanmaku has quit (Quit: Connection closed for inactivity).
08:50:59 <mroman_> !bfjoust single_decoy (>)*6(+)*128(>[-.])*-1
08:51:00 <zemhill> mroman_.single_decoy: points -29.67, score 4.83, rank 47/47
08:51:17 <mroman_> !bfjoust single_decoy (>)*6(+)*128(>[(+)*10[-].])*-1
08:51:18 <zemhill> mroman_.single_decoy: points -30.24, score 4.49, rank 47/47 (--)
08:51:47 <mroman_> !bfjoust single_decoy >(+)*128>*7(>[(+)*10[-].])*-1
08:51:48 <zemhill> mroman_.single_decoy: points -24.76, score 6.69, rank 47/47 (--)
08:51:53 <mroman_> !bfjoust single_decoy >(+)*128>*9(>[(+)*10[-].])*-1
08:51:53 <zemhill> mroman_.single_decoy: points -24.76, score 6.69, rank 47/47 (--)
08:51:59 <mroman_> !bfjoust single_decoy >(+)*128>*7(>[(+)*10[-].])*-1
08:51:59 <zemhill> mroman_.single_decoy: points -24.76, score 6.69, rank 47/47 (--)
08:52:08 <mroman_> !bfjoust single_decoy >(+)*128(>-)*7(>[(+)*10[-].])*-1
08:52:09 <zemhill> mroman_.single_decoy: points -20.17, score 8.13, rank 47/47 (--)
08:52:16 <mroman_> !bfjoust single_decoy >(+)*128(>->+)*4(>[(+)*10[-].])*-1
08:52:16 <zemhill> mroman_.single_decoy: points -18.50, score 8.82, rank 47/47 (--)
08:52:24 <mroman_> !bfjoust large_decoy >(+)*128(>->+)*4(>[(+)*10[-].])*-1
08:52:25 <zemhill> mroman_.large_decoy: points -18.50, score 8.82, rank 47/47
08:52:35 <mroman_> !bfjoust large_decoy >(+)*128(>-->++)*4(>[(+)*10[-].])*-1
08:52:36 <zemhill> mroman_.large_decoy: points -19.24, score 8.50, rank 47/47 (--)
08:52:43 <mroman_> !bfjoust large_decoy >(+)*128(>->+)*4(>[(+)*6[-].])*-1
08:52:44 <zemhill> mroman_.large_decoy: points -18.48, score 9.04, rank 47/47 (--)
08:52:48 <mroman_> !bfjoust large_decoy >(+)*128(>->+)*4(>[(+)*5[-].])*-1
08:52:51 <mroman_> !bfjoust large_decoy >(+)*128(>->+)*4(>[(+)*5[-].])*-1
08:52:52 <zemhill> mroman_.large_decoy: points -19.81, score 8.50, rank 47/47 (--)
08:52:55 <mroman_> !bfjoust large_decoy >(+)*128(>->+)*4(>[(+)*7[-].])*-1
08:52:56 <zemhill> mroman_.large_decoy: points -19.67, score 8.57, rank 47/47 (--)
08:53:01 <mroman_> !bfjoust large_decoy >(+)*128(>->+)*5(>[(+)*6[-].])*-1
08:53:01 <zemhill> mroman_.large_decoy: points -15.67, score 10.41, rank 47/47 (--)
08:53:07 <mroman_> !bfjoust large_decoy >(+)*128(>->+)*6(>[(+)*6[-].])*-1
08:53:09 -!- zemhill has quit (Remote host closed the connection).
08:54:02 -!- zemhill has joined.
08:55:46 <mroman_> !bfjoust large_decoy >(+)*128(>->+)*6(>[(+)*6[-].])*-1
08:55:46 <zemhill> mroman_.large_decoy: points -16.60, score 9.97, rank 47/47 (--)
08:55:52 <mroman_> !bfjoust large_decoy >(+)*128(>->+)*5(>[(+)*6[-].])*-1
08:55:53 <zemhill> mroman_.large_decoy: points -15.67, score 10.41, rank 47/47 (--)
08:56:03 <mroman_> !bfjoust large_decoy >(+)*128>(-)*128(>->+)*5(>[(+)*6[-].])*-1
08:56:04 <zemhill> mroman_.large_decoy: points -20.31, score 8.07, rank 47/47 (--)
08:56:08 <mroman_> !bfjoust large_decoy >(+)*128>(-)*128(>->+)*4(>[(+)*6[-].])*-1
08:56:08 <zemhill> mroman_.large_decoy: points -22.14, score 7.25, rank 47/47 (--)
08:56:12 <mroman_> !bfjoust large_decoy >(+)*128>(-)*128(>->+)*5(>[(+)*6[-].])*-1
08:56:12 <zemhill> mroman_.large_decoy: points -20.31, score 8.07, rank 47/47 (--)
08:56:20 <mroman_> !bfjoust large_decoy >(+)*64>(-)*64(>->+)*5(>[(+)*6[-].])*-1
08:56:20 <zemhill> mroman_.large_decoy: points -11.40, score 12.80, rank 47/47 (--)
08:56:28 <mroman_> !bfjoust large_decoy >(+)*64>(-)*64(>-->+)*5(>[(+)*6[-].])*-1
08:56:28 <zemhill> mroman_.large_decoy: points -11.36, score 12.82, rank 47/47 (--)
08:56:32 -!- FreeFull has quit (Ping timeout: 245 seconds).
08:56:32 <mroman_> !bfjoust large_decoy >(+)*64>(-)*64(>-->++)*5(>[(+)*6[-].])*-1
08:56:34 <zemhill> mroman_.large_decoy: points -12.14, score 12.43, rank 47/47 (--)
08:56:39 <mroman_> !bfjoust large_decoy >(+)*64>(-)*64(>--->+)*5(>[(+)*6[-].])*-1
08:56:40 <zemhill> mroman_.large_decoy: points -11.86, score 12.64, rank 47/47 (--)
08:56:47 <mroman_> !bfjoust large_decoy >(+)*64>(-)*64(>(-)*10>+)*5(>[(+)*6[-].])*-1
08:56:47 <zemhill> mroman_.large_decoy: points -8.67, score 13.94, rank 46/47 (+1)
08:56:51 <mroman_> !bfjoust large_decoy >(+)*64>(-)*64(>(-)*20>+)*5(>[(+)*6[-].])*-1
08:56:52 <zemhill> mroman_.large_decoy: points -8.81, score 14.37, rank 44/47 (+2)
08:56:56 <mroman_> !bfjoust large_decoy >(+)*64>(-)*64(>(-)*64>+)*5(>[(+)*6[-].])*-1
08:56:56 <zemhill> mroman_.large_decoy: points -14.76, score 11.15, rank 47/47 (-3)
08:57:06 <mroman_> !bfjoust large_decoy >(+)*64>(-)*64(>(-)*25>+)*5(>[(+)*6[-].])*-1
08:57:07 <zemhill> mroman_.large_decoy: points -9.29, score 13.83, rank 46/47 (+1)
08:57:14 <mroman_> !bfjoust large_decoy >(+)*64>(-)*64(>(-)*20>+)*5(>[(+)*6[-].])*-1
08:57:15 <zemhill> mroman_.large_decoy: points -8.81, score 14.37, rank 44/47 (+2)
08:57:29 <mroman_> !bfjoust large_decoy >(+)*64>(-)*64(>(-)*20>+)*4(>[(+)*6[-].])*-1
08:57:30 <zemhill> mroman_.large_decoy: points -9.71, score 13.69, rank 47/47 (-3)
08:57:34 <mroman_> !bfjoust large_decoy >(+)*64>(-)*64(>(-)*30>+)*4(>[(+)*6[-].])*-1
08:57:34 <zemhill> mroman_.large_decoy: points -11.64, score 12.37, rank 47/47 (--)
08:57:43 <mroman_> !bfjoust large_decoy >(+)*64>(-)*64(>(-)*20>++)*5(>[(+)*6[-].])*-1
08:57:44 <zemhill> mroman_.large_decoy: points -8.52, score 14.57, rank 43/47 (+4)
08:57:51 <mroman_> !bfjoust large_decoy >(+)*64>(-)*64(>(-)*20>(+)*20)*5(>[(+)*6[-].])*-1
08:57:51 <zemhill> mroman_.large_decoy: points -8.76, score 14.64, rank 43/47 (--)
08:58:34 <mroman_> !bfjoust large_decoy >(+)*32>(-)*32(>(-)*20>(+)*20)*5(>[(+)*6[-].])*-1
08:58:35 <zemhill> mroman_.large_decoy: points -8.29, score 14.84, rank 41/47 (+2)
08:58:45 <mroman_> !bfjoust large_decoy >(+)*32>(-)*32(>(-)*25>(+)*20)*5(>[(+)*6[-].])*-1
08:58:46 <zemhill> mroman_.large_decoy: points -7.43, score 15.47, rank 37/47 (+4)
08:58:49 <mroman_> !bfjoust large_decoy >(+)*32>(-)*32(>(-)*25>(+)*25)*5(>[(+)*6[-].])*-1
08:58:50 <zemhill> mroman_.large_decoy: points -7.50, score 15.30, rank 37/47 (--)
08:58:55 <mroman_> !bfjoust large_decoy >(+)*32>(-)*32(>(-)*25>(+)*20)*5(>[(+)*6[-].])*-1
08:58:55 <zemhill> mroman_.large_decoy: points -7.43, score 15.47, rank 37/47 (--)
08:59:09 <mroman_> !bfjoust large_decoy >(+)*16>(-)*16(>(-)*25>(+)*20)*5(>[(+)*6[-].])*-1
08:59:11 <zemhill> mroman_.large_decoy: points -7.55, score 15.23, rank 37/47 (--)
08:59:19 <mroman_> !bfjoust large_decoy >(+)*25>(-)*25(>(-)*25>(+)*20)*5(>[(+)*6[-].])*-1
08:59:20 <zemhill> mroman_.large_decoy: points -8.31, score 14.87, rank 39/47 (-2)
08:59:26 <mroman_> !bfjoust large_decoy >(+)*32>(-)*32(>(-)*25>(+)*20)*5(>[(+)*6[-].])*-1
08:59:27 <zemhill> mroman_.large_decoy: points -7.43, score 15.47, rank 37/47 (+2)
09:28:28 -!- L8D has quit (Ping timeout: 250 seconds).
10:04:03 <HackEgo> [wiki] [[Special:Log/newusers]] create * ChristeShannon * New user account
10:22:58 -!- boily has joined.
11:06:29 -!- GeekDude has joined.
11:07:31 -!- Melvar has joined.
11:12:22 <mroman_> !blsq "ChristeShannon")**)b2\[
11:12:24 <blsqbot> "1000011110100011100101101001111001111101001100101101001111010001100001110111011
11:12:31 <mroman_> !blsq "ChristeShannon")**)b2\[F:u[vv^^{1\/?/2\/LG}m[?*++
11:13:09 <mroman_> !blsq "aaaaaaaaa")**)b2\[F:u[vv^^{1\/?/2\/LG}m[?*++
11:13:32 <mroman_> !blsq "aaaaaaaaa"F:u[vv^^{1\/?/2\/LG}m[?*++
11:13:41 <mroman_> !blsq "ChristeShannon"F:u[vv^^{1\/?/2\/LG}m[?*++
11:13:52 <mroman_> !blsq "Nqn87SQA"F:u[vv^^{1\/?/2\/LG}m[?*++
11:14:05 <boily> who is Christe Shannon?
11:14:35 <boily> oh, right. we do have a wiki.
11:14:44 -!- Sorella has joined.
11:15:24 <mroman_> !blsq "Nqn87SQA"F:u[vv^^{1\/?/l2}m[?*++
11:15:34 -!- Sorella has quit (Changing host).
11:15:34 -!- Sorella has joined.
11:15:39 <mroman_> !blsq "Nqn87SQA"F:u[vvJ{1j?/l2}m[?*++
11:16:09 <mroman_> How do these password entropy calculations work?
11:16:12 <mroman_> they are not shannon entropy?
11:16:22 <mroman_> !blsq "abcdefg"F:u[vvJ{1j?/l2}m[?*++
11:16:29 <mroman_> ^- pretty much the same entropy as
11:16:38 <mroman_> !blsq "0bCdef!"F:u[vvJ{1j?/l2}m[?*++
11:18:08 <blsqbot> {{0.14285714285714285 'f} {0.14285714285714285 'e} {0.14285714285714285 'd} {0.1
11:18:16 <blsqbot> {{'f 'e 'd 'b 'C '0 '!} {0.14285714285714285 0.14285714285714285 0.1428571428571
11:18:30 <blsqbot> {{'f} {'e} {'d} {'b} {'C} {'0} {'!}}
11:18:38 <blsqbot> {0.14285714285714285 0.14285714285714285 0.14285714285714285 0.14285714285714285
11:18:53 <mroman_> !blsq "0bCdef!"F:)-]J{1j?/l2}m[?*++
11:21:01 <boily> !blsq "hunter2"F:)-]J{1j?/l2}m[?*++
11:21:32 <boily> 0.41. there is your answer there.
11:21:43 * boily is going to think about the question while shampooing his hair
11:22:01 -!- boily has quit (Quit: OXYDOREDUCTING CHICKEN).
11:23:21 <mroman_> !blsq "hunter2"^^F:)-]J{1j?/l2}m[?*++jL[#S
11:23:27 <mroman_> !blsq "hunter2"^^F:)-]J{1j?/l2}m[?*++#s
11:23:28 <blsqbot> {2.807354922057604 "hunter2"}
11:23:34 <mroman_> !blsq "hunter2"^^F:)-]J{1j?/l2}m[?*++jL[#s
11:23:38 <mroman_> !blsq "hunter2"^^F:)-]J{1j?/l2}m[?*++jL[?/
11:24:02 <mroman_> !blsq "mOarSecUR_*EpasswordZ!"^^F:)-]J{1j?/l2}m[?*++jL[?/
11:24:15 <mroman_> ^- so... this is pretty insecure then?
11:25:02 -!- L8D has joined.
11:29:18 <elliott_> that isn't a terribly good password
11:29:33 -!- L8D has quit (Ping timeout: 260 seconds).
11:29:42 <elliott_> it's three dictionary words with a bit of case/spelling wteaking and a very small number of symbols
11:29:57 <mroman_> I only use 6 char passwords anyway
11:30:07 <mroman_> and only lowercase letters
11:30:38 <mroman_> sites nowadays suggest using at least one uppercase letter, one digit and one symbol
11:30:57 <mroman_> so as a password cracker you can assume that there's at least one uppercase letter, one digit and one symbol
11:31:02 <elliott_> I hope you don't have a bank account.
11:31:10 <mroman_> which means you can rule out any combinations of lowercase letters only
11:31:24 <elliott_> okay I assume this is just a bad joke
11:31:34 <mroman_> the size of the set of all variations of lowercase,uppercas,digit and symbols is much larger
11:31:52 <mroman_> than the set of variations of that but with the constraint that every element needs to have a digit a symbol and an uppercase letter
11:31:55 -!- idris-bot has joined.
11:32:22 <mroman_> So I don't see why "qhtnbz" is less secure than "qHt)(7"
11:33:08 <mroman_> I mean, it is less secure if an attacker only tries lowercase passwords
11:33:40 <mroman_> but if attackers switch to only testing combinations with at least one digit and one upper case letter and one symbol
11:33:52 <mroman_> you're better of using "abcdahenotuaaexa" as your password
11:34:50 <elliott_> password crackers tend to assume that most people use bad passwords, like you.
11:35:02 <elliott_> you make it nice and easy for them.
11:35:38 <elliott_> mroman_: why not give me an SHA-256 hash of your freenode password?
11:35:52 <elliott_> presumably you have nothing to worry about
11:36:04 <Jafet> 6-byte lowercase passwords can be brute forced in about one millisecond
11:36:20 <elliott_> (consider that people are rather likely to already have hashes -- if not plaintexts -- of your passwords, thanks to widespread database compromises)
11:36:52 <mroman_> I can give you the hash of my root password
11:37:50 <elliott_> apparently there are 32 symbols on a US keyboard, who knew?
11:38:12 <mroman_> 8fc56e2acf7c40526fc7060b52c54f1a24e9778d
11:38:25 <Jafet> elliott: time to design an esolang
11:38:44 <elliott_> mroman_: what hash function is that?
11:39:53 <elliott_> anyway I'm going to assume that since it's your root password you don't use six lowercase letters for it and that's why you're comfortable giving it.
11:40:22 <Jafet> Or root logins are disabled
11:41:17 <elliott_> I assign Jafet to do the quick enumeration to check :p
11:41:49 <fizzie> The length matches SHA-1.
11:43:07 <elliott_> mroman_: anyway, read http://arstechnica.com/security/2013/05/how-crackers-make-minced-meat-out-of-your-passwords/ or whatever
11:43:30 <elliott_> or just wait for your accounts to get compromised and take that as a lesson
11:43:48 <elliott_> mroman_: hell, it's right there: "True to that pattern, Gosney's first stage cracked 10,233 hashes, or 62 percent of the leaked list, in just 16 minutes. It started with a brute-force crack for all passwords containing one to six characters, meaning his computer tried every possible combination starting with "a" and ending with "//////." "
11:44:10 <elliott_> bam, you just lost your passwords, even if you included numbers and symbols
11:44:18 <HackEgo> [wiki] [[Special:Log/newusers]] create * JavierRojas * New user account
11:44:41 <elliott_> ...I don't know why I'm arguing this at all.
11:45:21 <fizzie> @tell oerjan That sounds like a HASSLE. (But in theory, sure.)
11:46:09 <mroman_> elliott_: 6 char passwords with all printable ascii chars can be cracked in 13 minutes on a standard modern machine
11:46:26 <mroman_> so if you have a machine for cracking
11:46:29 <mroman_> it's way less than 13 minutes
11:46:42 <elliott_> ...is this meant to be a defence of 6 char passwords?
11:47:29 <elliott_> am I being trolled here. be honest.
11:49:48 <fizzie> There's also a freely available and reasonably small rainbow tables e.g. for sha1 hashes of all 1-10 letter lowercase-alphabetic-plus-digits passwords.
11:50:19 <fizzie> Maybe 587 gigabytes doesn't quite qualify as "reasonably small", but anyhow.
11:50:27 <mroman_> @what hash function is that
11:50:37 <elliott_> that's... no longer the question I most want an answer to at this point.
11:52:10 <mroman_> well which question do you want answered?
11:53:20 <mroman_> My bank account has two factor authentication
11:53:51 <elliott_> okay, so the answer to my last question is "yes"
12:01:57 <mroman_> but my real bank account password is 9 characters
12:03:56 <elliott_> do you just like losing all your money
12:08:49 <mroman_> days to crack it if you have the hash locally
12:10:16 <mroman_> of course, the official recommendation is using a length of 20
12:11:03 <mroman_> but I'm much more worried about a trojan sniffing my password rather than somebody actually brute-forcing it
12:11:20 <mroman_> especially because brute-forcing against online banking takes much much longer than a hash locally
12:11:28 <elliott_> please. never find yourself in a position of power or trust over others. other than that, do whatever.
12:11:40 <mroman_> I'm working in IT Security ;)
12:12:10 <elliott_> I... really hope you're joking.
12:14:10 <mroman_> I'm really working in IT Security
12:14:45 <mroman_> Currently I'm working on privacy preserving attribute based credential systems
12:15:26 <mroman_> But that doesn't mean I use a password of length 20 for my bank account
12:17:58 <mroman_> If anybody steals my money it's either on the street or because of a mitm-trojan that bypasses two factor authentication
12:19:10 <mroman_> How long is your bank account password?
12:19:12 <ion> http://youtu.be/boEb8zKfPBo | http://www.imdb.com/title/tt3514324/reviews?ref_=butt
12:19:38 <elliott_> I agree that 2FA makes your bank account comfortably secure.
12:19:45 <mroman_> I expect you to use a master-password and derive other passwords from it.
12:19:47 <elliott_> ...that doesn't mean you're not hopelessly wrong about password security.
12:20:13 <elliott_> my bank account password is 20 characters long because that is the limit.
12:20:39 <mroman_> Hash(hash("ebay") ++ hash("mysecretpassword"))
12:20:40 <elliott_> it is not derived from a master password (IIRC there are some potential security pitfalls with that in terms of leaking information about the master password); it is randomly generated.
12:21:17 <elliott_> anyway that system is useless if you want to periodically change your passwords.
12:21:25 <elliott_> since you need state anyway (a counter).
12:21:49 <mroman_> change the masterpassword periodically?
12:22:10 <mroman_> the site passwords is derived from the masterpassword
12:22:24 <elliott_> talking to you is frustrating.
12:22:27 <mroman_> sitePassword = hash(hash(site) + hash(masterpassword))
12:22:38 <Melvar> elliott_: So as the master password changes, so do the site passwords.
12:22:59 <elliott_> Melvar: okay, but I'd rather not have to change every single one of my passwords all at once.
12:23:20 <elliott_> Melvar: and I also don't see the benefit in changing the master password very regularly
12:23:25 <mroman_> You can embed a counter if you want
12:23:37 <mroman_> I don't know how secure hash(hash(counter) + hash(site) + hash(master)) is
12:23:45 <elliott_> mroman_: at that point you need to remember/store the counter; the system is no longer stateless. so just randomly generate passwords and store them encrypted.
12:24:33 <mroman_> you encrypt all passwords with the same key?
12:25:42 <elliott_> I randomly generate all my passwords, and store them encrypted with a strong master password, yes.
12:26:43 <elliott_> anyway, you should at least use a proper KDF rather than hash and ++ like that
12:27:55 <mroman_> I'm no security expert btw.
12:28:06 <mroman_> I didn't study security nor cryptology nor anything like that.
12:28:11 <elliott_> you didn't have to tell me that. (neither am I)
12:29:22 <mroman_> can you do replay attacks on ssl?
12:31:20 <mroman_> I guess in very bad circumstances it can be done
12:36:46 -!- Guest82163 has changed nick to paul2520.
12:37:02 -!- paul2520 has quit (Changing host).
12:37:02 -!- paul2520 has joined.
13:00:29 -!- L8D has joined.
13:10:20 -!- sebbu has quit (Ping timeout: 260 seconds).
13:10:54 <mroman_> `learn mroman is a leading artist in password security
13:11:08 <mroman_> `learn mroman_ is probably mroman but you can never be sure.
13:11:32 <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.
13:12:43 <mroman_> `learn hax0r (see ¯\(°_o)/¯)
13:12:51 <HackEgo> ¯\(°_o)/¯ is a misspelling of ¯\(°_o)/¯
13:17:57 <mroman_> there should be `append_learn
13:18:04 <HackEgo> /home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: `ls: not found
13:18:09 <HackEgo> ` \ ^.^ \ ̊ \ ! \ ? \ ¿ \ @ \ ؟ \ ＷＥＬＣＯＭＥ \ \ \ 8ball \ 8-ball \ aaaaaaaaa \ addquote \ addwep \ allquotes \ analogy \ anonlog \ as86 \ aseen \ bienvenido \ botsnack \ bseen \ buttsnack \ calc \ CaT \ catcat \ cats \ cc \ cdecl \ c++decl \ chroot \ coins \ CoInS \ complain \ complaints \ danddreclist \ define \ delquote \
13:18:22 <HackEgo> ./bin/learn \ ./.hg/store/data/bin/learn.i \ ./.hg/store/data/test/learn.i \ ./.hg/store/data/interps/clc-intercal/_c_l_c-_i_n_t_e_r_c_a_l-_docs-1.-94.-2/doc/examples/quantum/learn.i.i \ ./.hg/store/data/wisdom/`learn.i \ ./interps/clc-intercal/CLC-INTERCAL-Docs-1.-94.-2/doc/examples/quantum/learn.i
13:18:39 <HackEgo> #!/bin/bash \ topic=$(echo "$1" | lowercase | sed 's/^\(an\?\|the\) //;s/s\? .*//') \ echo "$1" >"wisdom/$topic" \ echo "I knew that."
13:19:12 <mroman_> `run echo #!/bin/bash > bin/append_learn
13:19:17 <HackEgo> exec bash -c "$1" \ echo hi \ #!/bin/sh \ CMD=`echo "$1" | cut -d' ' -f1` \ ARG=`echo "$1" | cut -d' ' -f2-` \ exec ibin/$CMD "$ARG"#!/bin/sh \ topic=$(echo "$1" | lowercase | sed "s/noo\+dl/nooodl/;s/ *$//") \ topic1=$(echo "$topic" | sed "s/s$//") \ cd wisdom \ if [ \( "$topic1" = "ngevd" \) -a \( -e ngevd \) ]; \ then cat /dev/urandom; \
13:19:58 <HackEgo> rm: cannot remove `bin/append_learn': No such file or directory
13:20:16 <HackEgo> bin/aaaaaaaaa \ bin/addquote \ bin/addwep \ bin/allquotes \ bin/analogy \ bin/anonlog \ bin/as86 \ bin/aseen
13:21:07 <mroman_> `run echo "echo \$//" > test
13:21:18 <HackEgo> bash: bin/bash: No such file or directory
13:21:22 <HackEgo> bash: ./bin/bash: No such file or directory
13:21:42 <mroman_> `run echo "echo *\$" > test
13:21:55 <mroman_> my lack of bash knowledge is bad :D
13:22:40 <HackEgo> #!/bin/bash \ topic=$(echo "$1" | lowercase | sed 's/^\(an\?\|the\) //;s/s\? .*//') \ echo "$1" >"wisdom/$topic" \ echo "I knew that."
13:24:29 <mroman_> `fetch http://codepad.org/PW0O3FBY/raw.txt
13:24:30 <HackEgo> 2014-09-26 13:23:46 URL:http://codepad.org/PW0O3FBY/raw.txt [132/132] -> "raw.txt" [1]
13:24:56 <mroman_> `run mv raw.txt bin/learn_append
13:25:01 <mroman_> `run chmod +x bin/learn_append
13:25:26 <mroman_> `learn_append test It's also not a test.
13:25:27 <HackEgo> /home/hackbot/hackbot.hg/multibot_cmds/lib/limits: /hackenv/bin/learn_append: /bin/bash^M: bad interpreter: No such file or directory \ /home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: /hackenv/bin/learn_append: Success
13:26:11 <mroman_> `run sed -e '/^M/d' bin/learn_append > bin/learn_append
13:26:15 <mroman_> `learn_append test It's also not a test.
13:26:16 <HackEgo> /home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: /hackenv/bin/learn_append: Success
13:29:23 -!- zolbap has joined.
13:32:45 -!- FreeFull has joined.
13:37:26 <HackEgo> curl: try 'curl --help' or 'curl --manual' for more information
13:38:07 -!- MoALTz has joined.
13:38:14 <mroman_> `run curl -x POST http://eso.mroman.ch/cgi/burlesque.cgi
13:38:15 <HackEgo> curl: (5) Couldn't resolve proxy 'POST'
13:38:21 <mroman_> `run curl -X POST http://eso.mroman.ch/cgi/burlesque.cgi
13:38:22 <HackEgo> curl: (7) couldn't connect to host
13:40:40 <mroman_> !blsq "Hi\r\nthere\r\n"{**13/=}f[
13:41:51 <mroman_> !blsq "Hi\r\nthere\r\n"{**13!=}f[
13:41:58 <blsqbot> ERROR: Unknown command: (/=)!
13:42:07 <mroman_> I like how ERROR-Values evaluate to true
13:42:12 <blsqbot> ERROR: Burlsque: (n!) Invalid arguments!
13:42:53 -!- Patashu has quit (Ping timeout: 240 seconds).
13:46:27 -!- sebbu has joined.
13:56:46 -!- copumpkin has quit (Quit: My MacBook Pro has gone to sleep. ZZZzzz…).
14:17:53 <mroman_> https://bitbucket.org/mroman_/emulathor/src/fc48fe22fdade5777099eea372e5f06e2b4d2b2b/src/rlang/std/string.rl?at=master#cl-65
14:23:49 <mroman_> IF (strlen [ src; ] != strlen [ dst; ]) THEN looks inefficient
14:24:08 -!- sebbu3 has joined.
14:24:35 <fizzie> Perhaps you expected Pascal strings instead.
14:25:18 -!- sebbu2 has joined.
14:26:26 <mroman_> I'm still a huge fan of the syntax though
14:26:40 -!- Phantom_Hoover has joined.
14:26:50 -!- Phantom_Hoover has quit (Changing host).
14:26:51 -!- Phantom_Hoover has joined.
14:26:54 -!- sebbu has quit (Ping timeout: 246 seconds).
14:27:26 -!- sebbu has joined.
14:28:02 -!- sebbu has quit (Changing host).
14:28:03 -!- sebbu has joined.
14:28:46 -!- sebbu3 has quit (Ping timeout: 250 seconds).
14:29:38 -!- sebbu2 has quit (Ping timeout: 250 seconds).
14:37:09 <mroman_> It's a clean readable not to pascal-ish syntax
14:49:22 -!- perrier has quit (Remote host closed the connection).
14:56:36 <HackEgo> [wiki] [[Special:Log/newusers]] create * DeenaQKZuynoiz * New user account
14:59:41 -!- perrier has joined.
15:22:04 -!- drdanmaku has joined.
15:25:47 -!- perrier has quit (Remote host closed the connection).
15:27:51 -!- perrier has joined.
15:29:35 -!- zolbap has quit (Quit: Leaving).
15:34:11 -!- L8D has quit (Remote host closed the connection).
15:38:00 -!- FreeFull has quit (Quit: BBL).
15:42:17 -!- ais523 has joined.
15:47:15 -!- AnotherTest has joined.
15:47:31 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)).
15:48:00 -!- sebbu has quit (Ping timeout: 272 seconds).
15:55:34 -!- sebbu has joined.
15:56:11 -!- sebbu has quit (Changing host).
15:56:11 -!- sebbu has joined.
16:01:45 <quintopia> what kind of strings does pascal have
16:02:45 <ais523> quintopia: "pascal strings" normally refers to strings where the first byte gives the length
16:02:49 <ais523> and the others are the content
16:03:05 <ais523> length+pointer is Rust strings; it's less efficient than C or Pascal strings but it has very cheap slicing
16:03:21 <Melvar> Never heard of that idea before.
16:03:37 <ais523> it died out, and probably for a good reason
16:04:45 <Melvar> Yeah, it precludes not only general slicing, but tailtaking which even null-terminated strings allow.
16:07:53 <shachaf> tromp: haskell@ is for announcements, not for jokes. It's meant to be low-volume. You can always send comments like that to -cafe@
16:08:17 -!- Phantom_Hoover has quit (Remote host closed the connection).
16:10:50 -!- Phantom_Hoover has joined.
16:12:04 <tromp> shachaf: ok, will restrain myself in future
16:19:26 -!- shikhin has joined.
16:26:36 <fizzie> The Internet is for...
16:27:44 <ais523> #esoteric is the international hub for esoteric programming language design, development and deployment
16:31:37 <b_jonas> how about BANCStar strings?
16:31:43 <b_jonas> are those efficiently slicable?
16:34:10 <zzo38> I don't know how it is internally implemented, but I know a MID$ function is available; one BANCStar program uses it on a string containing the entire alphabet simply to assign "N" to a variable. I suppose other methods of doing so aren't available for some reason?
16:34:17 <lambdabot> Sgeo asked 3d 13h 33m 30s ago: Do you have opinions on the speed of various interpreters? Supposedly this game is very impacted by such things http://emshort.wordpress.com/2012/12/31/counterfeit-monkey/
16:34:17 <lambdabot> mroman_ said 2d 6h 48m 29s ago: zzo38computer.org is pretty much unreachable.
16:34:31 <ais523> zzo38: BANCStar doesn't have constants
16:35:13 <b_jonas> it does have small integer constants
16:35:36 <b_jonas> let me check the wiki page
16:35:41 <ais523> maybe I remembered wrong, though
16:35:45 <zzo38> Yes, I suppose you are right; actually there are string constants but they have to take up part of the same space used for variables, which is limited to 2000. And yes there are integer literals.
16:35:49 <b_jonas> here, it allows literal integers http://esolangs.org/wiki/BANCStar#Arithmetic_instructions
16:36:50 <zzo38> Also, the IP address for zzo38computer.org has been changed recently; try again.
16:38:15 <ais523> zzo38: what was the TTL set to on the old domain?
16:38:31 <ais523> changes won't get through to other people's computers until after the TTL expires
16:38:38 <ais523> so, say, if it was a month
16:38:44 <coppro> C++ strings best strings
16:38:54 <ais523> then other people's compuers won't know about the new IP for up to a month
16:39:07 <coppro> length + pointer, except for when they're short, in which case they're length + data
16:39:16 <coppro> the distinction is made in the low bits of the pointer
16:40:26 <zzo38> ais523: I do not know what the TTL was set to; I don't have control over that; I only tell someone else to update it for me, and they then do so.
16:41:07 <coppro> I have dyndns set up for my home domain
16:46:21 <zzo38> About the speed of the "Counterfeit Monkey" game, well, it is compiled using Inform7, which is known to be pretty bad at optimization and produces slow programs. It is also Glulx, which probably will run slower than Z-machine code anyways (although it does have some ultra-CISC instructions to speed up some normally slow things)
16:49:38 <zzo38> Does the "M" in "M-theory" stand for a word that hasn't been invented yet (but is known ahead of type to start with "M")?
16:50:44 -!- conehead has joined.
16:52:45 <ais523> phew, I thought I'd accidentally set the TTL for motd.nethack4.org to 10 months
16:52:48 <ais523> turns out it was 10 minutes
16:59:45 -!- mroman2 has joined.
16:59:54 <mroman2> interesting stuff going on
17:00:35 <mroman2> How can I get blsqbot to tell me his IP address
17:00:51 <HackEgo> bash: nslookup: command not found
17:02:33 <Phantom_Hoover> ais523, hey, what's the deal with this nethack update business
17:02:55 <ais523> Phantom_Hoover: some source code that wasn't intended to be public got leaked
17:05:42 <ais523> <PAUSE> Over the years I have found the following methods of logging out. None of them is guaranteed to work
17:05:48 * ais523 is trying to get a module onto CPAN
17:06:02 <ais523> also, they threatened to spend up to a week to approve my account, three during holidays
17:06:14 <ais523> but that only took like 10-20 minutes
17:08:45 -!- mroman2 has quit (Quit: Page closed).
17:09:32 <ais523> "The new data are registered in table users."
17:09:43 <ais523> had to read that a few times before I realised it was correct grammar
17:12:08 <Phantom_Hoover> i saw some suggestions that it's been there since essentially the beginning
17:12:52 <ais523> <PAUSE> No action is required, but it would be a good idea if somebody would check the correctness of the new password.
17:13:02 <ais523> this is the most awesome package manager ever
17:13:32 <zzo38> What package manager is that?
17:13:45 <ais523> PAUSE is the backend to CPAN
17:14:01 <ais523> I guess having a different name for the frontend and backend is also something unique to PAUSE/CPAN
17:16:13 <ais523> Gregor: no, that's a little different
17:16:17 <ais523> it's more like Debian/apt
17:16:36 <ais523> basically, PAUSE is where you upload the packages, CPAN does the downloading
17:27:08 <zzo38> Do you know, people on NESdev argue about assigning a mapper number for Game Genie; I have also requested numbers for UNL-DripGame and other things too and it hasn't been done yet. Do you have any opinions about this too though?
17:30:34 <zzo38> These are the messages: http://forums.nesdev.com/viewtopic.php?f=3&t=11659 Maybe someone other than the people on NESdev would be possible to comment on it somehow
17:31:14 <Melvar> Phantom_Hoover: I saw somewhere the figure of 25 years.
17:41:44 <ais523> front page of nethack.org has a statement about it, although not the code itself
17:41:58 <ais523> I know where to find the code, but don't really want to spread links to it around, on the basis that the devteam didn't want it released
17:42:04 <ais523> it's mostly bugfixes, though
17:42:11 <elliott_> you think the devteam want you calling your release nethack 4?
17:42:41 <elliott_> also, who would leak nethack source, of all things? it's been 11 years
17:42:47 <ais523> elliott_: they're aware of the name, and haven't objected
17:43:08 <Phantom_Hoover> elliott_, changelog here: http://pastebin.com/raw.php?i=djZ5X2Hz
17:43:21 <elliott_> Phantom_Hoover: well, okay, but where was it leaked? usenet?
17:45:23 <elliott_> "We know who made it available to the public. What we don't know is where exactly he got his copy; although the list of people who could have given it to him is fairly short." nethack secrets...
17:47:11 -!- newsham has joined.
17:47:45 <elliott_> hmm, so I guess the dev who leaked it is probably no longer on the devteam
17:48:16 <zzo38> Do you know when it is supposed to be released?
17:48:26 <ais523> zzo38: there isn't an official release date, there never is
17:48:33 <ais523> they have a policy of never officially setting a release date
17:48:37 -!- Phantom_Hoover has quit (Ping timeout: 245 seconds).
17:48:45 <elliott_> they also have a policy of never officially releasing
17:54:34 -!- zemhill has quit (Remote host closed the connection).
17:54:59 -!- zemhill has joined.
17:55:49 -!- shikhout has joined.
17:56:17 <fizzie> !bftest this_will_not_modify_hill <
17:56:26 <fizzie> Whoops, I forgot to modify the config file again.
17:56:28 <fizzie> Every time same thing.
17:56:50 -!- zemhill has quit (Remote host closed the connection).
17:57:14 -!- zemhill has joined.
17:57:17 <fizzie> !bftest this_will_not_modify_hill <
17:57:17 <zemhill> fizzie: I broke down! Ask fizzie to help! The details are in the log!
17:57:18 -!- zemhill has quit (Client Quit).
17:57:28 <fizzie> It worked when I tried it locally, honest.
17:57:50 <Bike> i must say, it's nice that it tells you it's breaking isntead of just quitting
17:58:09 <fizzie> That's mostly so that (because my nick is in the message) I'll notice something bad has happened.
17:58:27 <shachaf> It could put something in the quit message.
17:58:47 <fizzie> It does, but for some reason it doesn't show up.
17:58:56 -!- shikhin has quit (Ping timeout: 250 seconds).
17:59:13 <fizzie> It tries to quit with "Abandon ship, abandon ship!" as the message.
17:59:37 <fizzie> Seems to have crashed in write_breakdown.
17:59:47 <ais523> fizzie: possibly a race condition; are you waiting for the ERROR response before actually closing the connection?
18:00:18 <fizzie> That's up to the bot framework, really.
18:00:52 <zzo38> There is something wrong with the speakers in my computer; sometimes it just makes a lot of noise
18:01:11 <ais523> isn't making a lot of noise what speakers are /supposed/ to do?
18:01:30 <Bike> controlled noise.
18:02:01 <zzo38> I mean it makes noise without being commanded by the computer; it is just a lot of cracks and pops and stuff
18:02:40 <quintopia> didn't you once write a warrior that tried to figure out an optimal offset?
18:02:57 <ais523> yes, decoytuner, but it was awful
18:03:24 <ais523> basically assuming all the opposing decoys were the same size
18:03:34 <ais523> and measuring the first large one
18:03:42 <quintopia> that would work a lot better on the current hill i think :P
18:03:51 <ais523> there was a second attempt, told, that I never submitted
18:03:52 -!- zemhill has joined.
18:03:55 <fizzie> !bftest this_will_not_modify_hill <
18:03:55 <zemhill> fizzie.this_will_not_modify_hill: points -46.00, score 0.00, rank 47/47
18:04:03 <ais523> which tried to estimate the size of the decoys via the number of cycles before the opponent started attacking
18:04:08 <ais523> I couldn't get it to work at all
18:04:10 <fizzie> Feel free to keep using it "normally" too, but if you don't want all parameter tunings end up on the hill, the !bftest command is also an option; you can then !bfjoust when you're happy with it. (Also if you !bftest in a query, it won't post the result on #esoteric.)
18:05:15 <fizzie> Inspired by few hundred overnight commits that, while in theory part of the Historical Record, are perhaps not all *that* useful for future BF Joust historians.
18:05:19 <quintopia> ais523: did you ever try to measure the first large decoy, use that offset until it didn't work, assume the offset should be larger and measure again?
18:05:20 -!- shikhout has changed nick to shikhin.
18:05:36 -!- ais523 has quit (Read error: Connection reset by peer).
18:05:39 -!- callforjudgement has joined.
18:06:20 <quintopia> sometimes i get the idea that's the main reason you irc
18:07:09 <callforjudgement> I do play nomic, but I don't IRC for nomic purposes; ##nomic is almost dead nowadays
18:07:12 -!- callforjudgement has changed nick to ais523.
18:07:30 <ais523> not that I wouldn't join in a conversation there if one happened
18:07:38 <ais523> but nomic is a very small consideration for me when choosing whether to join IRC
18:07:45 <ais523> most of my IRCing is NetHack-related atm
18:07:51 <ais523> although I just spent a while in #perl talking about my memory profiler
18:12:28 <mroman_> !bfjoust lilfuckabish (>+.+)*9([-]>)*3(<)*3(<)*9(>(+)*20>(-)*20)*4(>)*4(>[(+)*6[-].])*-1
18:12:28 <zemhill> mroman_.lilfuckabish: points -9.90, score 13.92, rank 46/47
18:13:10 <mroman_> !bfjoust lilfuckabish (>+.+)*9([-]>)*3(<)*3(<)*9(>(+)*20>(-)*20)*4(>)*3(>[(+)*6[-].])*-1
18:13:11 <zemhill> mroman_.lilfuckabish: points -12.00, score 12.72, rank 47/47 (-1)
18:13:14 <mroman_> !bfjoust lilfuckabish (>+.+)*9([-]>)*3(<)*3(<)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*6[-].])*-1
18:13:15 <zemhill> mroman_.lilfuckabish: points -9.17, score 14.32, rank 45/47 (+2)
18:15:29 <quintopia> ais523: did you ever try to measure the first large decoy, use that offset until it didn't work, assume the offset should be larger and measure again?
18:15:44 <ais523> quintopia: no, especially because that program would be very large
18:15:59 <ais523> also, something to note: if a decoy is 86 or larger, you don't gain at all even from a correct offset
18:16:06 <ais523> assuming that you can't also predict the parity
18:16:16 <ais523> (you shouldn't be able to predict the parity against a well-written program)
18:16:36 <quintopia> i'd think if you could measure decoys, you could just say "switch to reverse offset clear" at that point
18:17:16 <quintopia> is there no compact way to measure decoys under the assumption that they always increase in size?
18:17:20 <ais523> quintopia: actually, something I've been thinking about a lot recently
18:17:34 <ais523> is that once you find a large decoy, there's normally nothing but large decoys from there
18:17:41 <ais523> and if they're large enough, reverse offset clear is fastest
18:17:52 <ais523> so long as the offset's less than the size of the deocy
18:18:23 <quintopia> yeah this would be the sane way to handle something like preparation too. there's no way to avoid chewing through lots of decoys there, so might as well be the fastest at it
18:18:51 <quintopia> also i think you should submit preparation to the stackoverflow hill just for funsies
18:19:15 <ais523> quintopia: monolith was born when I realised you could beat preparation just by setting more than 7 decoys and having an equally good clear loop
18:19:22 <ais523> and I don't have a stackoverflow account
18:19:59 <ais523> submit space_hotel (although, might want to screw with it to beat nyuroki first)
18:20:27 <quintopia> well that's why we're discussing offset tuning :P
18:20:54 <quintopia> actually, i don't really want to submit space_hotel
18:23:22 <ais523> I did try adding a /small/ reverse offset clear (as in, (+)*5[+]) to one of my programs after the early timer had expired
18:23:36 <ais523> I think because there are still several programs that don't decoy all the way to their flag
18:26:53 -!- ais523 has quit.
18:27:09 -!- ais523 has joined.
18:30:01 <elliott_> isn't the SO hill ridiculously buggy?
18:30:03 -!- SvenGek has joined.
18:31:09 <ais523> it didn't accept ()% last I looked, not sure if it does now
18:31:33 <quintopia> i'm not sure if there is a way for space_hotel to beat nyuroki.
18:32:42 -!- sebbu has quit (Ping timeout: 245 seconds).
18:34:16 <quintopia> the only thing i can think of is adjust the polarity of decoys
18:34:33 <quintopia> which would take a lot of work since space_hotel has no script to generate it
18:35:12 <quintopia> but having the last two decoys go in opposite directions might improve things slightly
18:36:51 <quintopia> also maybe using your idea of having the offset be smaller depending on when the enemy is first seen on my side and how far away they were first seen on their side
18:40:14 <quintopia> there are some tape lengths where nyuroki wins by leaving a trail that happens to be the same as space_hotel's tripwire
19:01:17 <mroman_> !bfjoust lilfuckabish (>+.+)*9([-]>)*3(<)*3(<)*9(>(+)*30>(-)*30)*4(>)*5(>[(+)*6[-].])*-1
19:01:17 <zemhill> mroman_.lilfuckabish: points -11.62, score 12.57, rank 47/47 (-2)
19:01:26 <mroman_> !bfjoust lilfuckabish (>+.+)*9([-]>)*3(<)*3(<)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*6[-].])*-1
19:01:26 <zemhill> mroman_.lilfuckabish: points -9.17, score 14.32, rank 45/47 (+2)
19:01:35 <mroman_> !bfjoust lilfuckabish (>++)*9([-]>)*3(<)*3(<)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*6[-].])*-1
19:01:35 <zemhill> mroman_.lilfuckabish: points -5.76, score 16.70, rank 33/47 (+12)
19:01:44 <mroman_> !bfjoust lilfuckabish (>+)*9([-]>)*3(<)*3(<)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*6[-].])*-1
19:01:45 <zemhill> mroman_.lilfuckabish: points -4.02, score 17.96, rank 26/47 (+7)
19:01:58 <mroman_> !bfjoust lilfuckabish (>)*9([-]>)*3(<)*3(<)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*6[-].])*-1
19:01:58 <zemhill> mroman_.lilfuckabish: points -2.05, score 19.77, rank 21/47 (+5)
19:02:41 <mroman_> !bfjoust lilfuckabish (>)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*6[-].])*-1
19:02:41 <zemhill> mroman_.lilfuckabish: points -22.74, score 6.96, rank 47/47 (-26)
19:02:44 <mroman_> !bfjoust lilfuckabish (>)*9([-]>)*3(<)*3(<)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*6[-].])*-1
19:02:44 <zemhill> mroman_.lilfuckabish: points -2.05, score 19.77, rank 21/47 (+26)
19:04:18 <mroman_> !bfjoust lilfuckabish (>)*9([-]>)*3(<-)*3(<)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*6[-].])*-1
19:04:19 <zemhill> mroman_.lilfuckabish: points 1.52, score 23.07, rank 11/47 (+10)
19:04:26 <mroman_> !bfjoust lilfuckabish (>)*9([-]>)*3(<---)*3(<)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*6[-].])*-1
19:04:27 <zemhill> mroman_.lilfuckabish: points 1.12, score 22.48, rank 15/47 (-4)
19:04:31 <mroman_> !bfjoust lilfuckabish (>)*9([-]>)*3(<--)*3(<)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*6[-].])*-1
19:04:32 <zemhill> mroman_.lilfuckabish: points 1.83, score 23.30, rank 11/47 (+4)
19:04:44 <mroman_> !bfjoust lilfuckabish (>)*9([-]>)*3(<--)*3(<-)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*6[-].])*-1
19:04:44 <zemhill> mroman_.lilfuckabish: points 2.40, score 23.89, rank 10/47 (+1)
19:04:52 <mroman_> !bfjoust lilfuckabish (>)*9([-]>)*3(<--)*3(<--)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*6[-].])*-1
19:04:52 <zemhill> mroman_.lilfuckabish: points 1.67, score 23.01, rank 11/47 (-1)
19:05:00 <mroman_> !bfjoust lilfuckabish (>)*9([-]>)*3(<--)*3(<-)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*6[-].])*-1
19:05:00 <zemhill> mroman_.lilfuckabish: points 2.40, score 23.89, rank 10/47 (+1)
19:10:43 -!- callforjudgement has joined.
19:11:04 -!- ais523 has quit (Disconnected by services).
19:11:06 -!- callforjudgement has changed nick to ais523.
19:15:07 <fizzie> mroman_: In case you didn't notice, I added a !bftest command that you can use if you want to 'quietly' do parameter tuning before submitting. (If you noticed but just want to do it the old-fashioned way, that's perfectly fine.)
19:17:45 -!- TieSoul_ has joined.
19:18:56 -!- TieSoul_ has quit (Remote host closed the connection).
19:18:58 <elliott_> also, you could pick a better program name than lilfuckabish
19:19:02 -!- TieSoul has quit (Ping timeout: 245 seconds).
19:19:26 -!- TieSoul has joined.
19:34:25 -!- Sorella has quit (Ping timeout: 260 seconds).
19:36:42 -!- Sorella has joined.
19:37:31 -!- Sorella has quit (Changing host).
19:37:31 -!- Sorella has joined.
19:38:55 <elliott_> ais523: does the leaked NH have that one feature that was known to appear in the next version?
19:39:09 <ais523> I would be very surprised if it didn't
19:39:11 <ais523> do you want me to check?
19:39:34 <elliott_> yes, just because that'd be hilarious
19:39:48 <elliott_> finally we can experience the first nethack feature in 11 years
19:40:19 <ais523> however, at least one of the variants already implemented it before the leak
19:40:24 <ais523> purely based on the fact it was known to exist
19:40:33 <elliott_> but does it behave identically??
19:40:51 <ais523> who knows; I'm not going to check that
19:41:00 <ais523> as it'd require actually understanding the code in both ases
19:43:21 <elliott_> you should only have code in one ass at a time.
19:50:58 -!- Bicyclidine has joined.
19:51:54 <Jafet> If you copy code to multiple asses, do you have a posterior distribution
19:52:12 <mroman_> !bfjoust lilfuckabish (>)*9([-]>)*3(<--)*3(<-)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*8[-].])*-1
19:52:12 <zemhill> mroman_.lilfuckabish: points 4.05, score 25.47, rank 9/47 (+1)
19:52:15 <mroman_> !bfjoust lilfuckabish (>)*9([-]>)*3(<--)*3(<-)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*9[-].])*-1
19:52:16 <zemhill> mroman_.lilfuckabish: points 3.12, score 24.56, rank 9/47 (--)
19:52:20 <mroman_> !bfjoust lilfuckabish (>)*9([-]>)*3(<--)*3(<-)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*8[-].])*-1
19:52:21 <zemhill> mroman_.lilfuckabish: points 4.05, score 25.47, rank 9/47 (--)
19:52:24 <mroman_> !bfjoust lilfuckabish (>)*9([-]>)*3(<--)*3(<-)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*8[-]])*-1
19:52:24 <zemhill> mroman_.lilfuckabish: points 4.02, score 25.40, rank 9/47 (--)
19:52:28 <mroman_> !bfjoust lilfuckabish (>)*9([-]>)*3(<--)*3(<-)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*8[-].])*-1
19:52:29 <zemhill> mroman_.lilfuckabish: points 4.05, score 25.47, rank 9/47 (--)
19:57:08 <mroman_> this is actually pretty good
19:57:20 <mroman_> you rush forward and perform a clear of some cells
19:57:29 -!- InputUsername has joined.
19:57:35 <mroman_> in case the tape is longer you go back into a decoy setup
19:57:44 <mroman_> followed by another whole-tape-offset-clear
19:59:38 <elliott_> how is furry_furry_strapon_pegging_girls still alive and kicking years later?
20:00:00 <elliott_> it's one of the longest-living ones on the hill now, surely?
20:00:43 <ais523> elliott_: allegro/pendolino have been there for ages
20:01:28 <mroman_> I don't wanna know what he encoded in b64 there
20:02:59 -!- InputUsername has left.
20:03:49 <fizzie> ais523: The trains are now gone, actually.
20:05:00 <mroman_> how can you submit via StackOverflow?
20:05:17 <fizzie> ais523: pendolino was displaced by this "lilfuckabish", and allegro by a Lymia.yolo yesterday morning.
20:05:38 <ais523> fizzie: well they were there for ages :-)
20:05:59 <ais523> what about leviathan/juggernaught?
20:06:03 -!- idris-bot has quit (Ping timeout: 246 seconds).
20:06:15 -!- Melvar` has joined.
20:06:43 <fizzie> dreadnought, leviathan and behemoth are still there.
20:06:50 <fizzie> Except I haven't remembered to fix their names.
20:06:56 -!- Melvar has quit (Disconnected by services).
20:06:59 -!- Melvar` has changed nick to Melvar.
20:08:30 <zemhill> mroman_.lilfuckabish: points -46.00, score 0.00, rank 47/47 (-38)
20:09:29 <mroman_> !bfjoust cupnoodles (>)*9([-]>)*3(<--)*3(<-)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*8[-].])*-1
20:09:30 <zemhill> mroman_.cupnoodles: points 4.05, score 25.47, rank 9/47
20:12:22 -!- TieSoul has quit (Ping timeout: 245 seconds).
20:13:52 <mroman_> isn't the tape at least 10?
20:13:57 -!- idris-bot has joined.
20:14:10 <mroman_> !bfjoust cupnoodles (>)*10([-]>)*3(<--)*3(<-)*10(>(+)*20>(-)*20)*4(>)*5(>[(+)*8[-].])*-1
20:14:11 <zemhill> mroman_.cupnoodles: points 2.05, score 23.17, rank 11/47 (-2)
20:14:16 <mroman_> !bfjoust cupnoodles (>)*10([-]>)*3(<--)*3(<-)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*8[-].])*-1
20:14:17 <zemhill> mroman_.cupnoodles: points 2.02, score 23.15, rank 11/47 (--)
20:14:21 <mroman_> !bfjoust cupnoodles (>)*9([-]>)*3(<--)*3(<-)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*8[-].])*-1
20:14:22 <zemhill> mroman_.cupnoodles: points 4.05, score 25.37, rank 9/47 (+2)
20:14:27 <elliott_> mroman_: you start on cell 0, and if the valid tape positions are [0,9) that's 10 cells
20:14:41 <elliott_> (>)*9 increments it by 9, so you end up on cell 9, which is the tenth cell
20:14:45 <mroman_> !bfjoust cupnoodles (>)*9([-]>)*3(-<-)*3(<-)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*8[-].])*-1
20:14:46 <zemhill> mroman_.cupnoodles: points 4.60, score 25.91, rank 9/47 (--)
20:15:08 <mroman_> !bfjoust cupnoodles (>)*9([-]>)*3(--<)*3(<-)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*8[-].])*-1
20:15:08 <zemhill> mroman_.cupnoodles: points 3.74, score 25.04, rank 9/47 (--)
20:15:19 <mroman_> !bfjoust cupnoodles (>)*9([-]>)*3(-<-)*3(<-)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*8[-].])*-1
20:15:20 <zemhill> mroman_.cupnoodles: points 4.60, score 25.91, rank 9/47 (--)
20:16:15 <mroman_> !bfjoust cupnoodles (>)*9([-]>)*3(-<-)*3(<-)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*8[-].]>[(-)*8[+].])*-1
20:16:16 <zemhill> mroman_.cupnoodles: points 7.55, score 29.51, rank 8/47 (+1)
20:16:21 <mroman_> !bfjoust cupnoodles (>)*9([-]>)*3(-<-)*3(<-)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*8[-].]>[(-)*7[+].])*-1
20:16:21 <zemhill> mroman_.cupnoodles: points 7.26, score 29.11, rank 8/47 (--)
20:16:25 <mroman_> !bfjoust cupnoodles (>)*9([-]>)*3(-<-)*3(<-)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*8[-].]>[(-)*9[+].])*-1
20:16:25 <zemhill> mroman_.cupnoodles: points 7.33, score 29.23, rank 8/47 (--)
20:16:31 <mroman_> !bfjoust cupnoodles (>)*9([-]>)*3(-<-)*3(<-)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*8[-].]>[(-)*8[+].])*-1
20:16:31 <zemhill> mroman_.cupnoodles: points 7.55, score 29.51, rank 8/47 (--)
20:16:42 <mroman_> !bfjoust cupnoodles (>)*9([-]>)*3(-<-)*3(<-)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*8[-].]>[(-)*8[+]])*-1
20:16:43 <zemhill> mroman_.cupnoodles: points 7.38, score 29.20, rank 8/47 (--)
20:16:46 <mroman_> !bfjoust cupnoodles (>)*9([-]>)*3(-<-)*3(<-)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*8[-].]>[(-)*8[+].])*-1
20:16:46 <zemhill> mroman_.cupnoodles: points 7.55, score 29.51, rank 8/47 (--)
20:18:22 <mroman_> fizzie: I'm impressed that zemhill can immediately report the results
20:19:09 <mroman_> corewars hill aren't that fast
20:19:25 <mroman_> although part of that might be mail delay
20:25:49 -!- TieSoul has joined.
20:26:04 -!- Phantom_Hoover has joined.
20:31:08 <fizzie> mroman_: Well, it only takes to the order of 360 million cycles to run the whole hill, let alone just a single program (which would on average be just 15M cycles, and probably the median is smaller than the mean thanks to ais523.margins and such).
20:31:32 <ais523> everyone loves margins :-)
20:36:29 -!- sebbu2 has joined.
20:36:55 <mroman_> maybe I should enter the generator business
20:37:30 <ais523> I don't use generators for most of my programs
20:38:02 <mroman_> entering the top 5 is going to be hard
20:39:09 <mroman_> !bfjoust cupnoodles (>)*9([-].>)*3(-<-)*3(<-)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*8[-].]>[(-)*8[+].])*-1
20:39:09 <zemhill> mroman_.cupnoodles: points 6.60, score 28.20, rank 8/47 (--)
20:39:28 <mroman_> !bfjoust cupnoodles (>)*9([(+)*9[-]]>)*3(-<-)*3(<-)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*8[-].]>[(-)*8[+].])*-1
20:39:29 <zemhill> mroman_.cupnoodles: points 9.95, score 32.82, rank 6/47 (+2)
20:39:39 <mroman_> !bfjoust cupnoodles (>)*9([(+)*9[-].]>)*3(-<-)*3(<-)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*8[-].]>[(-)*8[+].])*-1
20:39:39 <zemhill> mroman_.cupnoodles: points 9.71, score 32.49, rank 6/47 (--)
20:39:48 <mroman_> !bfjoust cupnoodles (>)*9([(+)*10[-]]>)*3(-<-)*3(<-)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*8[-].]>[(-)*8[+].])*-1
20:39:49 <zemhill> mroman_.cupnoodles: points 9.76, score 32.54, rank 6/47 (--)
20:39:56 <mroman_> !bfjoust cupnoodles (>)*9([(+)*8[-]]>)*3(-<-)*3(<-)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*8[-].]>[(-)*8[+].])*-1
20:39:57 <zemhill> mroman_.cupnoodles: points 9.95, score 32.77, rank 6/47 (--)
20:40:05 <mroman_> !bfjoust cupnoodles (>)*9([(+)*9[-]]>)*3(-<-)*3(<-)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*8[-].]>[(-)*8[+].])*-1
20:40:05 <zemhill> mroman_.cupnoodles: points 9.95, score 32.82, rank 6/47 (--)
20:40:14 <mroman_> !bfjoust cupnoodles (>)*9([(+)*9[-]]>)*4(-<-)*4(<-)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*8[-].]>[(-)*8[+].])*-1
20:40:15 <zemhill> mroman_.cupnoodles: points 10.26, score 33.01, rank 6/47 (--)
20:40:25 <mroman_> !bfjoust cupnoodles (>)*9([(+)*9[-]]>)*5(-<-)*5(<-)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*8[-].]>[(-)*8[+].])*-1
20:40:25 <zemhill> mroman_.cupnoodles: points 7.31, score 28.99, rank 8/47 (-2)
20:40:34 -!- callforjudgement has joined.
20:40:34 <mroman_> !bfjoust cupnoodles (>)*9([(+)*9[-]]>)*4(-<-)*4(<-)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*8[-].]>[(-)*8[+].])*-1
20:40:35 <zemhill> mroman_.cupnoodles: points 10.26, score 33.01, rank 6/47 (+2)
20:40:38 -!- ais523 has quit (Disconnected by services).
20:40:40 -!- callforjudgement has changed nick to ais523.
20:41:07 <mroman_> !bfjoust cupnoodles (>)*9([(+)*9[-]]>[(-)*9[+]]>)24(-<-)*4(<-)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*8[-].]>[(-)*8[+].])*-1
20:41:07 <zemhill> mroman_.cupnoodles: points -44.10, score 0.38, rank 47/47 (-41)
20:41:09 -!- sebbu2 has quit (Ping timeout: 260 seconds).
20:41:11 <elliott_> !bfjoust loyalty (>)*8[<](>[(-[{[-.]}])%128]>[(+[{[+.]}])%128])*11
20:41:11 <zemhill> elliott_.loyalty: points -7.86, score 14.50, rank 44/47
20:41:17 <mroman_> !bfjoust cupnoodles (>)*9([(+)*9[-]]>[(-)*9[+]]>)*4(-<-)*4(<-)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*8[-].]>[(-)*8[+].])*-1
20:41:17 <zemhill> mroman_.cupnoodles: points 4.17, score 24.67, rank 9/47
20:41:22 <elliott_> !bfjoust loyalty (>)*8[<](>[(-[{[-.]}])%128]])*21
20:41:22 <zemhill> elliott_: error: parse error: terminating ] without a matching [
20:41:25 <elliott_> !bfjoust loyalty (>)*8[<](>[(-[{[-.]}])%128])*21
20:41:25 <mroman_> !bfjoust cupnoodles (>)*9([(+)*9[-]]>)*4(-<-)*4(<-)*9(>(+)*20>(-)*20)*4(>)*5(>[(+)*8[-].]>[(-)*8[+].])*-1
20:41:25 <zemhill> elliott_.loyalty: points -13.48, score 11.43, rank 46/47
20:41:26 <zemhill> mroman_.cupnoodles: points 10.26, score 33.01, rank 6/47
20:41:55 <mroman_> !bfjoust cupnoodles (>)*9([(+)*9[-]]>)*4(-<-)*4(<-<+)*4<-(>(+)*20>(-)*20)*4(>)*5(>[(+)*8[-].]>[(-)*8[+].])*-1
20:41:55 <zemhill> mroman_.cupnoodles: points 10.81, score 33.77, rank 6/47 (--)
20:42:03 <mroman_> !bfjoust cupnoodles (>)*9([(+)*9[-]]>)*4(-<-)*4(<-<-+)*4<-(>(+)*20>(-)*20)*4(>)*5(>[(+)*8[-].]>[(-)*8[+].])*-1
20:42:03 <zemhill> mroman_.cupnoodles: points 9.57, score 32.00, rank 6/47 (--)
20:42:23 <mroman_> !bfjoust cupnoodles (>)*9([(+)*9[-]]>)*4(-<-)*4(<-<--)*4<-(>(+)*20>(-)*20)*4(>)*5(>[(+)*8[-].]>[(-)*8[+].])*-1
20:42:24 <zemhill> mroman_.cupnoodles: points 9.90, score 32.49, rank 6/47 (--)
20:42:46 <mroman_> !bfjoust cupnoodles (>)*9([(+)*9[-]]>)*4(-<-)*4(<-<+)*4<-(>(+)*20>(-)*20)*4(>)*5(>[(+)*8[-].]>[(-)*8[+].])*-1
20:42:46 <zemhill> mroman_.cupnoodles: points 10.81, score 33.77, rank 6/47 (--)
20:42:51 -!- sebbu has joined.
20:43:02 <mroman_> !bfjoust cupnoodles (>)*9([(+)*9[-]]>)*4(-<-)*4(<-<+)*4<-(>(+)*20>(-)*20)*4(>)*5(>[(+)*9[-].]>[(-)*9[+].])*-1
20:43:03 <zemhill> mroman_.cupnoodles: points 10.62, score 33.48, rank 6/47 (--)
20:43:14 <mroman_> !bfjoust cupnoodles (>)*9([(+)*9[-]]>)*4(-<-)*4(<-<+)*4<-(>(+)*22>(-)*22)*4(>)*5(>[(+)*8[-].]>[(-)*8[+].])*-1
20:43:14 <zemhill> mroman_.cupnoodles: points 10.55, score 33.52, rank 6/47 (--)
20:43:15 <shachaf> How do function declarations (rather than definitions) work in K&R C?
20:43:25 <mroman_> !bfjoust cupnoodles (>)*9([(+)*9[-]]>)*4(-<-)*4(<-<+)*4<-(>(+)*15>(-)*15)*4(>)*5(>[(+)*8[-].]>[(-)*8[+].])*-1
20:43:26 <zemhill> mroman_.cupnoodles: points 9.19, score 31.87, rank 6/47 (--)
20:43:36 <mroman_> !bfjoust cupnoodles (>)*9([(+)*9[-]]>)*4(-<-)*4(<-<+)*4<-(>(+)*20>(-)*20)*4(>)*5(>[(+)*8[-].]>[(-)*8[+].])*-1
20:43:36 <zemhill> mroman_.cupnoodles: points 10.81, score 33.77, rank 6/47 (--)
20:43:49 <elliott_> has anyone written a generator for that god-awful never execute a ] style?
20:44:04 <mroman_> !bfjoust cupnoodles (>)*9([(+)*9[-]]>)*4(-<-)*4(<-<+)*4<----(>(+)*20>(-)*20)*4(>)*5(>[(+)*8[-].]>[(-)*8[+].])*-1
20:44:04 <zemhill> mroman_.cupnoodles: points 10.69, score 33.66, rank 6/47 (--)
20:44:06 <shachaf> Oh, it's botspam o'clock again.
20:44:11 <mroman_> !bfjoust cupnoodles (>)*9([(+)*9[-]]>)*4(-<-)*4(<-<+)*4<-(>(+)*20>(-)*20)*4(>)*5(>[(+)*8[-].]>[(-)*8[+].])*-1
20:44:11 <zemhill> mroman_.cupnoodles: points 10.81, score 33.77, rank 6/47 (--)
20:44:20 <mroman_> until I have some other idea
20:45:02 <mroman_> elliott_: you mean [>[>[>]]] stuff?
20:45:33 <elliott_> bf joust is a lot more on-topic than telling people what haskell mailing lists to use
20:46:00 <elliott_> or telling people what articles they should correct on wikipedia
20:47:01 -!- sebbu has quit (Ping timeout: 244 seconds).
20:47:23 <ais523> it's completely ontopic
20:47:37 <shachaf> I didn't say anything about the topic.
20:47:39 <ais523> one of the few times the deployment has happened /right here in this channel/, and it inspires discussion, too
20:47:55 <elliott_> in case it's not clear, I'm telling you to shut up about what people use the channel for before I get annoyed enough to kick you.
20:48:18 <shachaf> You'll probably kick me anyway.
20:48:29 <shachaf> I don't expect anything less than nastiness from you at this point. I don't really know what I've done (though I have a couple of guesses) but I don't think paying attention to what you say to me will be useful.
20:48:39 <shachaf> I agree that telling people what to use the channel for isn't great.
20:48:51 <shachaf> I also agree that telling people to fix things on Wikipedia, or whatever, isn't great.
20:48:55 <elliott_> actually I'm just annoyed at your behaviour in the channel lately.
20:49:27 <ais523> fwiw, my extended absences from the channel are normally caused by offtopic discussion I dislike
20:49:34 <ais523> (this is the most common reason for me to leave /any/ IRC channel)
20:49:49 <shachaf> That is a reasonable reason to leave.
20:49:52 -!- FreeFull has joined.
20:50:50 <shachaf> (That wasn't a rhetorical question: I'm asking to confirm the general time interval when the annoyed-by-shachaf bit flipped in your head. Because it was fairly noticeable.)
20:52:49 -!- vyv has quit (Ping timeout: 272 seconds).
20:52:59 <elliott_> ok, I signed up for asking you to stop doing what you're doing, not grill me about your weird personal assumptions, so whatever
20:53:38 -!- vyv has joined.
20:54:17 <mroman_> !bfjoust rabbit ([>[-]]..+)*-1
20:54:19 <shachaf> Well, like I said, I don't expect much anyway.
20:54:36 <mroman_> !bfjoust rabbit ([>[-]]..+)*-1
20:54:36 <zemhill> mroman_.rabbit: points -30.95, score 4.50, rank 47/47 (--)
20:54:43 <mroman_> !bfjoust rabbit (>)*9([>[-]]..+)*-1
20:54:43 <zemhill> mroman_.rabbit: points -24.19, score 6.60, rank 47/47 (--)
20:54:46 <mroman_> !bfjoust rabbit (>-)*9([>[-]]..+)*-1
20:54:47 <zemhill> mroman_.rabbit: points -23.88, score 6.69, rank 47/47 (--)
20:54:53 <mroman_> !bfjoust rabbit (>->+)*4([>[-]]..+)*-1
20:54:53 <zemhill> mroman_.rabbit: points -23.45, score 6.82, rank 47/47 (--)
20:55:01 <mroman_> !bfjoust rabbit (>(-)*10>(+)*10)*4([>[-]]..+)*-1
20:55:02 <zemhill> mroman_.rabbit: points -13.90, score 11.15, rank 47/47 (--)
20:55:09 <mroman_> !bfjoust rabbit (>(-)*20>(+)*20)*4([>[-]]..+)*-1
20:55:09 <zemhill> mroman_.rabbit: points -14.48, score 11.43, rank 47/47 (--)
20:55:16 <mroman_> !bfjoust rabbit (>(-)*32>(+)*32)*4([>[-]]..+)*-1
20:55:16 <zemhill> mroman_.rabbit: points -15.00, score 11.03, rank 47/47 (--)
20:55:22 <shachaf> "trying to get a few words in before you're kicked" isn't a great way to formulate cohesive thoughts anyway.
20:55:25 <mroman_> !bfjoust rabbit (>(-)*32>(+)*32)*2>>>>([>[-]]..+)*-1
20:55:25 <zemhill> mroman_.rabbit: points -18.60, score 8.94, rank 47/47 (--)
20:55:32 <mroman_> !bfjoust rabbit (>(-)*10>(+)*10)*4([>[-]]..+)*-1
20:55:32 -!- zemhill has quit (Remote host closed the connection).
20:57:01 <elliott_> uh, is it not auto-restarting or is it just slow?
20:57:20 <ais523> it doesn't autorestart
20:57:40 <ais523> fizzie: zemhill just crashed again; suspiciously similar circumstances to the matrix segfault we had earlier
20:57:58 <elliott_> fizzie put an autorestart on it when it was being really crashy, I think?
20:59:09 <fizzie> It's supposed to autorestart.
20:59:28 <fizzie> too many programs: 48 > 47 (RuntimeError)
20:59:52 <fizzie> Now how'd that happen.
21:01:10 <fizzie> "But I put in a mutex!"
21:01:57 <fizzie> I assume some logic broke and did not 'git rm' a file when it should have.
21:02:44 <fizzie> Though I don't know where. Latest non-update is 971e3e0 Replacing StackOverflow.Sylwester_TerribleThorV2 by mroman_.rabbit and that properly deletes StackOverflow.Sylwester_TerribleThorV2.
21:02:46 -!- Bicyclidine has quit (Ping timeout: 272 seconds).
21:04:12 <fizzie> Okay, yes, I guess it must be a race thing, although I don't know how.
21:05:12 <fizzie> There's a commit that replaced mroman_.cupnoodles with elliott_.loyalty, and then right after that an edit to mroman_.cupnoodles that just created a new file.
21:07:07 -!- callforjudgement has joined.
21:07:17 -!- ais523 has quit (Disconnected by services).
21:07:19 -!- callforjudgement has changed nick to ais523.
21:08:23 <elliott_> fizzie: how are nested ()%s interpreted again?
21:09:34 -!- zemhill_ has joined.
21:09:51 <ais523> elliott_: outermost % matches innermost {}
21:09:57 <fizzie> "abbbc abbbc abbbc d ..." and so on. Or if you mean the actual implementation, uglily.
21:09:58 <ais523> however, I'm not sure all (any?) interps implement taht
21:11:42 <fizzie> ais523: Lymia was bugging me about not allowing e.g. (a(b{c(d{e{f}})*%1})%2)%3 so that the very innermost { would bind with the outermost ( because the middle level is "already filled".
21:11:59 <ais523> fizzie: oh, there's another annoying interp bug you have
21:12:05 <ais523> you treat () with nothing after them as a comment
21:12:16 <ais523> which is annoyingly permissive, because such programs crash /my/ interp
21:12:20 <ais523> and now I'm not sure which should change
21:12:29 <ais523> (i.e. (+-+) is equivalent to (+-+)*0)
21:12:41 -!- Bicyclidine has joined.
21:12:45 <fizzie> Yes, I know. I think that was intentional, but I don't remember the rationale.
21:13:04 <ais523> there's such a dubious comment in space_elevator
21:13:10 <ais523> I actually have a local patch to remove the parens
21:13:18 <ais523> annoyingly, the comment in question is "(thanks ais523)"
21:13:30 <elliott_> () working as a comment is kind of aesthetically pleasing.
21:13:35 <mroman_> !bfjoust rabbit (>)*9([(+)*9[-]]>)*4(-<-)*4(<-<+)*4<-(>(+)*10>(-)*10)*4(>)*5([>[(+)*9[-]]]..+)*-1
21:13:35 <zemhill_> mroman_.rabbit: points 5.40, score 26.47, rank 10/47 (+37)
21:13:42 <zemhill_> mroman_.rabbit: points -46.00, score 0.00, rank 47/47 (-37)
21:13:51 <fizzie> I wonder how I should poke that thing to make it notice the _ is unnecessary now.
21:14:16 <fizzie> Oh well, it'll segfault in the matrix lib sooner or later anyway.
21:14:29 <ais523> this is an encouraging method of development :-)
21:14:58 <ais523> actually, the reason I haven't set up my IRC bot for nethack4 yet is an argument over whether it should run all the time, or only when it has something to say
21:15:02 <ais523> (also, I haven't written it yet)
21:15:23 <ais523> really, I'd like the bot to join whenever it has something to say and it isn't already there, and stay the rest of the time
21:15:37 <mroman_> !bfjoust ([>[(+)*9[-]]]..+)*-1
21:15:38 <zemhill_> mroman_: "!bfjoust progname code". See http://zem.fi/bfjoust/ for documentation.
21:15:42 <mroman_> !bfjoust rabbit ([>[(+)*9[-]]]..+)*-1
21:15:43 <zemhill_> mroman_.rabbit: points -31.55, score 4.29, rank 47/47 (--)
21:16:12 <fizzie> One of the authors of the library mentioned about possibly helping me to track down that bug.
21:16:14 <mroman_> !bfjoust rabbit (>(-)*13>(+)*9)*4([>[(+)*9[-]]]..+)*-1
21:16:15 <zemhill_> mroman_.rabbit: points -4.52, score 17.03, rank 31/47 (+16)
21:16:56 <fizzie> Also, I just switched that thing to a refactored version where there's an explicit queue of tasks (and a single thread communicating with gearlanced), hopefully that'll eliminate the races.
21:17:03 <mroman_> !bfjoust rabbit (>(-)*13>(+)*9)*4([>[(+)*9[-]]].+)*-1
21:17:03 <zemhill_> mroman_.rabbit: points -3.07, score 18.27, rank 25/47 (+6)
21:17:09 <mroman_> !bfjoust rabbit (>(-)*13>(+)*9)*4([>[(+)*9[-]]]+)*-1
21:17:09 <zemhill_> mroman_.rabbit: points -2.05, score 19.02, rank 23/47 (+2)
21:17:23 <elliott_> ais523: set -n on the channel and have it /msg without joining
21:17:29 <mroman_> I thought ]]] should be enough for wait until opponent dies
21:17:46 <ais523> elliott_: huh, that's not an awful idea
21:17:52 <ais523> is there a "-n exemption" mode?
21:17:57 <ais523> spambots tend to really like non--n channels
21:18:08 <elliott_> on other networks, maybe, but freenode?
21:19:08 <zemhill_> mroman_.rabbit: points -46.00, score 0.00, rank 47/47 (-24)
21:19:14 <mroman_> I don't want to much bots on the hill
21:19:20 <fizzie> It would arguably make some amount of sense if +I worked as a "can message freely" exemption, but it doesn't.
21:19:30 <mroman_> I guess that's not fair to have too many bots on the hill
21:19:54 -!- ChanServ has set channel mode: +o ais523.
21:19:58 -!- ais523 has set channel mode: +C.
21:20:00 -!- ais523 has set channel mode: -o ais523.
21:20:15 <ais523> just realised there's a readymade solution to people running +. by mistake
21:20:28 <elliott_> how do I survey #esoteric client usage now?
21:20:58 <fizzie> RAW >>> :kornbluth.freenode.net 404 fungot #esoteric :Cannot send to channel <<<
21:20:58 <fungot> fizzie: the effect of the monstrous sight was indescribable, for some peculiar atmospheric tensity made me feel that the tomb was very comfortable, and more than this, but i did not like the guidance of one long practised in these explorations, and possessed of a kind of reputation for feats of strength and closed in again. this time the second week charles began to be manifest, and i must cast off these impressions of weaker m
21:21:02 -!- ChanServ has set channel mode: +o elliott_.
21:21:04 -!- elliott_ has set channel mode: -n.
21:21:04 -!- ChanServ has set channel mode: +n.
21:21:09 <elliott_> let's see how much spam it actually causes -- oh come on
21:21:19 -!- AnotherTest has quit (Ping timeout: 272 seconds).
21:21:23 <ais523> bleh, there's no such thing as a +n exemption
21:21:28 -!- elliott_ has set channel mode: -o elliott_.
21:21:48 -!- ChanServ has set channel mode: +o elliott_.
21:21:54 -!- elliott_ has set channel mode: -n.
21:22:05 -!- elliott_ has set channel mode: -o elliott_.
21:22:15 <elliott_> I'll give it 24 hours (I'm actually curious as to whether spambots even notice)
21:22:20 <zemhill_> mroman_.skip: points -29.19, score 4.34, rank 47/47
21:22:28 <ais523> so if anyone wanted to spam, we'd be a prime target
21:22:41 <ais523> hmm, I wonder if any of the honeypot channels are -n -s
21:22:42 <elliott_> ais523: well, I'll set +n again before going to sleep, then
21:22:42 <shachaf> We use -n in #haskell-lens and have never had spam.
21:22:54 <ais523> shachaf: is it -s or +s?
21:22:59 <elliott_> ais523: lots of continuous integration/git commit bots rely on -n
21:23:04 <elliott_> including I think github's built-in support
21:23:12 <elliott_> so I'd be surprised if you actually get spam, especially on a network as boring as freenode
21:23:14 <ais523> being -n means I can check its /mode remotely :-)
21:23:32 <ais523> elliott_: it's the largest network, isn't it?
21:23:41 <ais523> that'd make it the best target for spam
21:23:56 <elliott_> ais523: it's the network least like efnet
21:24:01 <ais523> now I'm wondering what +m -n does
21:24:26 <fizzie> I don't think it allows external messages even with -n if it's moderated.
21:24:42 <shachaf> What if you are +V in chanserv?
21:24:53 <shachaf> (Almost certainly still not.)
21:26:23 <fizzie> I haven't seen the $j ban yet in use, but I was wondering if it's going to lead to channels whose only purpose is to serve as a "blacklist" for other channels.
21:26:39 <fizzie> Also whether it allows you to go past the ban limit by making supplementary ban channels.
21:27:45 <ais523> clearly you need a modified $j that bans people who are ops in specific channels, for channels that hate each other
21:36:00 -!- TieSoul_ has joined.
21:36:57 -!- TieSoul has quit (Ping timeout: 245 seconds).
21:39:30 -!- Sorella has quit (Ping timeout: 250 seconds).
21:44:34 -!- ais523 has quit (Remote host closed the connection).
21:44:44 -!- ais523 has joined.
21:45:20 -!- Patashu has joined.
21:48:55 -!- ais523 has quit (Read error: Connection reset by peer).
21:49:00 -!- callforjudgement has joined.
21:49:08 -!- callforjudgement has changed nick to ais523.
21:51:57 -!- GeekDude has joined.
22:04:00 -!- Bicyclidine has quit (Ping timeout: 272 seconds).
22:08:27 -!- Sorella has joined.
22:09:24 -!- Sorella has quit (Changing host).
22:09:25 -!- Sorella has joined.
22:22:35 -!- callforjudgement has joined.
22:22:50 -!- ais523 has quit.
22:27:28 <HackEgo> [wiki] [[Fishstacks]] http://esolangs.org/w/index.php?diff=40543&oldid=39829 * 67.78.57.11 * (+8)
22:39:52 -!- oerjan has joined.
22:40:55 <lambdabot> fizzie said 10h 55m 34s ago: That sounds like a HASSLE. (But in theory, sure.)
23:16:56 -!- Bicyclidine has joined.
23:19:09 -!- Melvar` has joined.
23:19:42 -!- idris-bot has quit (Ping timeout: 258 seconds).
23:20:51 -!- Melvar has quit (Ping timeout: 258 seconds).
23:21:14 -!- Melvar` has changed nick to Melvar.
23:21:17 -!- idris-bot has joined.
23:22:23 -!- Bicyclidine has quit (Ping timeout: 258 seconds).
23:30:25 -!- Bicyclidine has joined.
23:41:18 -!- GeekDude has changed nick to ahk.
23:41:22 -!- ahk has changed nick to ahkscript.
23:41:38 -!- ahkscript has changed nick to smilebasic.
23:42:13 -!- smilebasic has changed nick to GeekTest.
23:42:23 -!- GeekTest has changed nick to smilebasic.
23:42:31 -!- smilebasic has changed nick to SmileBASIC.
23:42:37 -!- SmileBASIC has changed nick to GeoDude.
23:45:13 -!- Melvar` has joined.
23:46:36 -!- idris-bot has quit (Ping timeout: 272 seconds).
23:46:48 -!- Melvar has quit (Ping timeout: 272 seconds).
23:46:52 -!- Melvar` has changed nick to Melvar.
23:49:19 -!- idris-bot has joined.
23:50:29 -!- scarf has joined.
23:50:36 -!- scarf has changed nick to ais523.
23:50:40 -!- callforjudgement has quit (Read error: Connection reset by peer).
23:55:55 -!- shikhout has joined.
23:59:05 -!- shikhin has quit (Ping timeout: 260 seconds).