00:01:37 [[```]] M https://esolangs.org/w/index.php?diff=154713&oldid=154712 * Kaveh Yousefi * (+1) Amended an orthographic mistake. 00:23:48 -!- tromp has quit (Quit: My iMac has gone to sleep. ZZZzzz…). 01:16:11 -!- FreeFull has quit. 01:30:12 [[General blindfolded arithmetic]] https://esolangs.org/w/index.php?diff=154714&oldid=154703 * Stkptr * (+1344) /* Summary */ 01:38:45 [[Special:Log/newusers]] create * Shazun bhasfu * New user account 01:46:19 [[SECIAEQBNJMPDIFZR]] N https://esolangs.org/w/index.php?oldid=154715 * Esdraslov * (+2101) Created page with "SECIAEQBNJMPDIFZR (SEt C to a If A is EQuals to B aNd JuMP to D if b is ZeRo) is a [[OISC]] by [[User:Esdraslov]]. == How to code == === Printing === We need the usage of some variables like IOI (Input Output Index) to make our code better an 02:05:04 -!- op_4 has quit (Remote host closed the connection). 02:05:35 -!- op_4 has joined. 02:37:10 -!- craigo has quit (Quit: Leaving). 03:46:29 -!- zzo38 has quit (Ping timeout: 248 seconds). 03:52:09 -!- ais523 has quit (Ping timeout: 276 seconds). 04:00:11 -!- ais523 has joined. 04:25:53 -!- tromp has joined. 04:26:02 -!- tromp has quit (Client Quit). 04:26:44 [[!lyriclydemoteestablishcommunism!]] https://esolangs.org/w/index.php?diff=154716&oldid=154691 * PrySigneToFry * (+222) 04:33:38 [[SECIAEQBNJMPDIFZR]] https://esolangs.org/w/index.php?diff=154717&oldid=154715 * Stkptr * (+47) 4 billion addresses each with 4 billion possible values is finite 04:36:22 [[Insanity]] https://esolangs.org/w/index.php?diff=154718&oldid=116350 * Stkptr * (+54) 04:37:21 [[General blindfolded arithmetic]] https://esolangs.org/w/index.php?diff=154719&oldid=154714 * Stkptr * (+89) /* Example languages */ 04:39:52 [[Talk:Unsmiley]] N https://esolangs.org/w/index.php?oldid=154720 * Stkptr * (+285) Created page with "== Computability == Since this can arbitrarily modify its own specification, could it be [[uncomputable]]? What are the limits of its self rewriting? Could it add a command which solves the halting problem? ~~~~" 04:56:14 [[Snowflake]] https://esolangs.org/w/index.php?diff=154721&oldid=105725 * Ais523 * (+32) see also [[Unsmiley]] 04:56:21 [[Unsmiley]] https://esolangs.org/w/index.php?diff=154722&oldid=154701 * Ais523 * (+33) see also [[Snowflake]] 05:08:15 ais523: How's this? https://gist.github.com/MostAwesomeDude/f31eff9e483a9e0223f14fb629c55755 I think it properly taunts the reader while assuring them that they don't understand what's going on. 05:10:56 korvo: I'm not convinced BF is an A rather than a P, especially if you can't go left of the starting location 05:12:14 ais523: It's got a lovely monoid which produces a pile of symmetries. A compiler into BF has to choose e.g. how to move values from one cell to another. 05:12:43 korvo: oh, things like [>+<-] versus [->+<] 05:12:56 I forgot that symmetry 05:13:24 Yeah. Those give non-trivial automorphisms. Malbolge doesn't have anything quite so forgiving, because the automorphism has to act on the encrypted text. 05:14:01 Thue as an F also seems like a stretch – I think you can meaningfully define the computational class of a Thue program, which seems wrong for an F 05:14:51 err, I meant complexity class and said the wrong thing 05:15:52 I guess my intuition is "if the language lets you define both bubble sort and merge sort, and there's a way to tell them apart, the language is not operating only on functions" 05:16:26 in any case, I think algorithms versus programs is a continuum rather than two clear categories, depending on how much symmetry there is 05:16:58 when compiling you can often choose options for symmetries one by one, rather than having to do it all at once 05:19:06 Oh, all of these languages require us to write programs. The difference is that some of them promise that some programs are equivalent to others. 05:20:01 In a Brand F language, the programmer doesn't get a choice of algorithm. A Thue author has to confront genuine non-determinism, including perhaps adversarial or nemesis runtimes. A Prolog author can rely on WAM-style evaluation order. 05:20:15 during my PhD (and a little before) I was working with a functional hardware description language in which program equivalence was literally and concretely definable 05:21:02 In a Brand P language, the programmer must specify any optimizations themselves, because the machine only cares about details and has no insight into its actions. 05:21:10 I was dealing with languages that had bounded memory, and knew it – and that meant that you could in theory translate your program into a finite state machine with I/O on the transitions 05:21:38 and the programs were equivalent if and only if those were equivalent (i.e. same I/O behaviour even if the state numbering didn't match or some states were duplicated) 05:23:01 Nice. Sounds a lot like defunctionalization. 05:23:27 korvo: Byzantine (demonic) Thue is not a concept I've thought about much before, except when defining Thue programs that work regardless of evaluation order in order to avoid questions about what Thue's evaluation order actually is 05:24:21 I think most people (who know about Thue) consider its evaluation order to be either angelic nondeterminism (i.e. "the interpreter makes choices that will cause the program to work correctly, maybe by evaluating all possibilities in parallel") or entirely random 05:25:01 I believe (but may be incorrect) that it was originally intended to be the former, and that it has generally been interpreted as the latter by people writing for or implementing the language 05:25:41 Yeah, I got kind of ruined by that one paper introducing adversarial quicksort. Really changed my views on what we mean when we say "choose" or "random" or "non-deterministic". 05:27:19 byzantine failures are such an interesting programming concept that feels very esoteric – although they have a fairly real-world usage, in considering how an attacker might attack a program 05:28:19 but for, e.g., byzantine-failure-tolerant distributed systems, you have to consider that the failed node might send any possible sequence of bytes over the network, including sequences that contain, e.g., encryption keys that it doesn't know 05:30:05 Yep. We usually handle that by saying that a value is "unguessable" if it is, in fact, guessable. Very poor terminology. But the idea is that we assume unguessable values won't be guessed. In practice, we count the bits; 256 bits is fairly unguessable today. 05:30:39 And then any capability-theoretic statement can be extended across a network by weakening unforgeability to unguessability. 05:30:46 -!- zzo38 has joined. 05:31:38 [[Infinite state machine]] https://esolangs.org/w/index.php?diff=154723&oldid=108021 * Stkptr * (-1262) Replace it with actually correct information 05:31:53 it would be nice if there were a concise term for "the probability of this ever being guessed within the useful life of the system is too low for us to worry about, even if there's a concerted computing effort made against it" 05:32:39 Sometimes we use the same "exponentially-unlikely" phrasing as physicists doing thermodynamics. 05:33:03 Have we done thermodynamics of (Turing) machines here yet? It's a fun mind-bender. 05:34:43 But yeah, this is nicer than the standard Gordian knot. For example, recently I saw folks arguing over whether ASLR is security by obscurity or not. The answer is no, because ASLR can be revealed using Kerchoff's principle, and the address layout is merely unguessable. 05:35:29 I generally consider security to not be "by obscurity" if the thing that's obscure is randomized between sufficiently many symmetrical possibilities 05:36:33 the reason security by obscurity doesn't work is the same reason that using single words that a human chose mentally as passwords doesn't work – the number of possibilities that a human is reasonably likely to think of is small enough that the chance of guessing them is unacceptably high 05:38:39 fwiw, I don't consider ASLR reliable, but the reason is different – the number of possibilities is too small for me to be comfortable that they won't be guessed 05:39:31 it'd be more secure if there were a way to detect failed attempts and lock out the attacker, but often that isn't available for one reason or another, and ASLR has been broken before just by running the program repeatedly until you get the address you need 05:39:55 and living with all the segfaults and other similar consequences all the times when the address rolled wrong 05:40:23 (additionally, pointer leaks are semi-common – I wouldn't be confident that any given program had no pointer leaks unless the language was enforcing that somehow) 05:41:33 And at that point, the language might as well enforce pointer hygiene to cut off the entire avenue of attack. 05:43:43 Valgrind can detect some improper memory accesses and memory leaks. (I often find more memory leaks and invalid accesses in libraries called by my programs than in my programs themself, and when I do find them in my program I can usually correct them without so much difficulty) 05:43:59 I think that ASLR has some advantages and disadvantages. 05:45:35 zzo38: so I think Valgrind Memcheck doesn't work against the sort of attacks ASLR is designed to mitigate, unless it's able to notice a return address being overwritten 05:45:54 because those attacks use only valid memory addresses that the program is able to access legitimately 05:45:58 I don't know whether or not valgrind detects that 05:47:06 (maybe it is able to do so but not by default; there are some things that it does not do by default but you can add extra switches to do so) 05:47:12 I don't know either – my guess is no, but in theory it could notice a return-from-subroutine machine code command popping an address that wasn't written by a call-subroutine command 05:47:39 although that would have a lot of false positives nowadays, now that Spectre is a problem that most OSes and compilers want to mitigate 05:47:53 In some programs (although, I think mostly written in assembly language rather than in C, probably), it is sometimes useful to use specific addresses for some things. 05:49:21 C compilers used to (and for some platforms still do) compile static and global variables to be stored at memory addresses hardcoded in the generated program, and sometimes also do that for the address of called functions (although it's hard to make that compatible with shared objects so usually they don't) 05:49:56 (With my own idea of operating system design, the program is supposed to be guaranteed the same every time it is run if the program is the same and all input is the same, so ASLR will not be suitable. I have other ideas as well, though.) 05:50:27 x86-64 was a big improvement over x86 in that respect – it has an easy syntax for IP-relative memory addressing, which has most of the advantages of hardcoded addresses but is more compatible with ASLR 05:50:49 (although it doesn't allow randomizing the section containing the program code separately from the section containing static variables) 05:51:37 it makes the shared object case easier, too 05:52:09 (and by "easy syntax" I mean easy in the machine code) 05:52:15 Yes, and IP-relative addressing can be helpful for other reasons as well, if you have both absolute and relative addressing available 05:53:48 x86-64 does still have absolute addressing although the syntax is a bit more complex (they used the simplest syntax for relative, which I think was the right decision) 05:54:44 absolute addressing isn't so useful there because the commands can't take 64-bit immediate values, so the only addresses you can access absolutely are those in the bottom 4 GiB of memory 05:55:03 (possibly the bottom 2 GiB if it's interpreted as a signed number, which it might be) 06:17:03 [[257-wrap brainfuck]] https://esolangs.org/w/index.php?diff=154724&oldid=154641 * Ais523 * (+1197) unstub, cat, and use a more typical page structure 06:20:20 -!- ais523 has quit (Quit: quit). 07:09:02 -!- tromp has joined. 07:15:49 -!- Lord_of_Life_ has joined. 07:17:02 -!- Lord_of_Life has quit (Ping timeout: 268 seconds). 07:17:15 -!- Lord_of_Life_ has changed nick to Lord_of_Life. 08:02:17 [[R + S]] https://esolangs.org/w/index.php?diff=154725&oldid=154678 * C++DSUCKER * (+75) 08:34:40 -!- tromp has quit (Quit: My iMac has gone to sleep. ZZZzzz…). 09:33:48 -!- tromp has joined. 09:35:51 [['Python' is not recognized]] https://esolangs.org/w/index.php?diff=154726&oldid=154575 * Ractangle * (-32) 09:36:28 [['Python' is not recognized]] https://esolangs.org/w/index.php?diff=154727&oldid=154726 * Ractangle * (-13) 09:48:34 [['Python' is not recognized]] https://esolangs.org/w/index.php?diff=154728&oldid=154727 * Ractangle * (-6) 09:48:54 Heya 10:11:29 -!- Sgeo has quit (Read error: Connection reset by peer). 10:24:02 ais523: Oh this is a bit wild... yes, offsets are signed but if you use 32 bit addressing you get a zero-extended address. But also, virtual addresses are sign-extended. But Linux doesn't allow user space pointers to have the topmost bit set. Otherwise you'd get 6GB of absolute addressable memory. Thirdly, there are some special instructions to load from an absolute 64 bit address. 10:59:56 [[Apollo(PSTF)]] N https://esolangs.org/w/index.php?oldid=154729 * PrySigneToFry * (+3690) Created page with "Apollo is a Brainfuck derivative designed by PSTF. This is inspired from [[Artemis]], [[Brainfuck 2.0]], [[Masqualia]], [[BFInfinity]], Javascript, and [[Brainfuck extended]]. = Syntax Overview = As a Brainfuck derivative, Apollo is [[Turing-complete]], has 11:04:50 [[Apollo]] N https://esolangs.org/w/index.php?oldid=154730 * PrySigneToFry * (+292) Created page with "There are two esolangs calls Apollo in history or currently: # [[User:Hppavilion1/UniFunge]](This is already called Apollo, but then changed to Unifunge) by [[User:Hppavilion1]], which is a fungeoid. # [[Apollo(PSTF)]] by [[User:PrySigneToFry]], which is a Brainfuck 11:05:35 [[Language list]] https://esolangs.org/w/index.php?diff=154731&oldid=154707 * PrySigneToFry * (+13) 11:25:55 The IPv6 story has stalled a little, except that my ISP's support replied that "we've escalated to the relevant team for further investigation and will let you know", followed by an automated email saying (basically) "you didn't reply to our earlier email, if we don't hear back in 48 hours we'll assume you no longer need help and close your ticket", which was a little rude. 11:30:23 So I sent them back a second list of random debugging things I've tried (other Europe DO datacenters also fail; those also get routed through LONAP; non-Europe DO networks are fine; both the DHCPv6 delegated prefix and the single address assigned to the router behave the same; LONAP's looking-glass service shows that the router sending the address-unreachable errors last changed up/down state the 11:30:25 same day the problems started; traffic to another VPS that goes through LINX instead of LONAP works fine) mostly just to keep it alive. 11:33:27 Oh, DO support just sent a similar thing, except their timer is 3 days rather than 2. 12:02:51 It would be nice if you could still tell IPv6 packets which way they should go, to be able to better test these things, but they deprecated that option long ago -- https://www.rfc-editor.org/rfc/rfc5095.txt -- and I imagine most places wouldn't have respected it anyway. 12:06:38 " a functional hardware description language in which program equivalence was literally and concretely definable / bounded memory" => did the hardware also have no nondeterminism in cases that you'd call undefined behavior? 12:12:58 fizzie; "to the relevant team" sounds like a deliberately obscure answer, they don't even want to tell you what department. did they escalate to their criminal reporting department because they think you need IPV6 for money laundering or sending spam? their mental health department because they think you're crazy? their team with the shovels and optical cables to lay new optical cable next to your house? 12:14:46 "if we don't hear back in 48 hours" => I assume it's enough if they hear back that you did the same test again and still have the same symptoms, eg. can't access the server through IPV6 from your connection but hosts in other ISPs can 12:38:18 -!- CanisCorvus has joined. 14:19:58 [[Special:Log/move]] move * PkmnQ * moved [[Apollo(PSTF)]] to [[Apollo (PSTF)]]: Misspelled title: space 14:20:52 -!- amby has joined. 14:27:17 [[Apollo]] https://esolangs.org/w/index.php?diff=154734&oldid=154730 * PrySigneToFry * (+1) 14:28:41 [[Apollo(PSTF)]] https://esolangs.org/w/index.php?diff=154735&oldid=154733 * PrySigneToFry * (+59) Removed redirect to [[Apollo (PSTF)]] 14:49:32 -!- ais523 has joined. 14:50:17 did the hardware also have no nondeterminism in cases that you'd call undefined behavior? ← there was no UB in the language (it was somewhat easier than normal to avoid because the langauge didn't support division, just addition, subtraction, multiplication and bitwise operators) 14:50:56 the research was primarily about statically avoiding race conditions (interestingly, Rust ended up doing the same thing, basically the same way, a couple of years later) 14:51:14 so we didn't have problems with those either 14:54:40 I see 15:16:39 -!- tromp has quit (Quit: My iMac has gone to sleep. ZZZzzz…). 15:17:20 ais523: https://logs.esolangs.org/libera-esolangs/2025-03-30.html#lFb was for you 15:34:39 -!- tromp has joined. 15:36:26 [[WhatLang]] M https://esolangs.org/w/index.php?diff=154736&oldid=150865 * DGCK81LNN * (-4) 15:48:05 -!- ais523 has quit (Ping timeout: 248 seconds). 15:48:32 [[WhatLang]] M https://esolangs.org/w/index.php?diff=154737&oldid=154736 * DGCK81LNN * (-40) 15:50:11 -!- craigo has joined. 15:51:02 [[WhatLang]] M https://esolangs.org/w/index.php?diff=154738&oldid=154737 * DGCK81LNN * (+13) /* Koishi runtime specific */ 16:14:09 [[User:Esdraslov]] N https://esolangs.org/w/index.php?oldid=154739 * Esdraslov * (+195) Created page with "I am [[User:Esdraslov]] == My Esosteric programming languages == [[CDE2+]] EDE [[HeXPlik]] _!dlroW ,olleH-=p[ int-e: ooh, so it's even more complicated than I expected 17:04:53 I didn't know that either. :) 17:18:34 -!- tromp has quit (Quit: My iMac has gone to sleep. ZZZzzz…). 17:36:42 -!- tromp has joined. 17:55:10 * ais523 finds a yacc grammar which produces exponentially large compiled output: https://codegolf.stackexchange.com/a/278992 17:56:50 I like this one because it exploits properties of the target virtual machine – almost all yacc implementations compile via deterministic push-down automata, and this program can't be represented in less than exponential code by a DPDA 17:57:28 so in a way the output is "inherently" exponentially large 18:03:37 now I'm wondering how non-yaccs handle this – I suspect backtracking parsers might do quite well as they can handle the entire program in only 24 backtracks 18:16:05 -!- Sgeo has joined. 18:16:35 ais523: is this one of those that get much easier to parse if the input is reversed? 18:17:08 b_jonas: yes, but you can work around that by writing the reverse grammar too and concatenating them with a `2` between them 18:17:11 so that reversing doesn't help 18:19:03 as for compiler bombs, I recently tried what happens if you give rustc an exponential size macro_rules macro expansion. it just blows up, doesn't seem to have limits stopping that. 18:19:56 [[User:Ractangle]] https://esolangs.org/w/index.php?diff=154740&oldid=151770 * Ractangle * (-11) /* Other things */ 18:20:23 the threat model for DOS attacks on compilers is interesting 18:20:48 most of the time you assume that any code you're going to compile, you're also going to run unsandboxed, so there isn't a need to guard against source code that maliciously attacks the compiler 18:21:48 I have seen some compilers that don't make that assumption, e.g. Rust's `regex` crate intentionally aims for performance that's linear-time in the length of the regex plus the length of its input, meaning that malicious end-user-supplied regexes can't cause a DOS 18:22:12 yeah 18:23:29 there's this DOS I recently found that is not related to a compiler but should be running sandboxed => https://logs.esolangs.org/libera-esolangs/2025-03.html#lDU 18:23:32 [[L-system]] M https://esolangs.org/w/index.php?diff=154741&oldid=154670 * Stkptr * (+19) /* Python implementation (D2L) */ Support empty string emission 18:24:23 hmm, maybe the "prevent this web page showing additional dialogs" option should be used in that case too, if it isn't already 18:24:43 you don't get to choose options between the dialogs 18:24:55 and the dialog is modal so you can't choose anything during the dialog 18:25:04 can't even close the tab 18:27:00 I think the option is normally placed *in* the dialog so that you can select it even if the dialog is modal 18:27:07 but maybe Firefox can't adjust the file-save dialog like that 18:27:55 is it too heretical to suggest that the problem here is JS ;-) 18:28:16 does that attack even require JS? 18:28:29 how else would you trigger *multiple* downloads at the same time? 18:28:42 a frameset, perhaps? 18:28:49 hmm maybe 18:29:25 just frames 18:30:02 I think everyone learns the frames trick from sourceforge, it shows a frame to be able to show you an advertisment-riddled page and send a download at the same time 18:30:05 -!- FreeFull has joined. 18:30:39 . o O ( what's sourceforge ) (scnr) 18:31:14 yeah, you can't really modify the Windows save dialog that way, at least not in a way that's transparent to the users. you could put a fake save format in the list, but users might not find it. 18:31:43 but firefox could ask a question after you cancel a save dialog 18:32:15 [[HeXPlik]] https://esolangs.org/w/index.php?diff=154742&oldid=154706 * Stkptr * (+29) Seems TC enough 18:32:21 like after that you have to click somewhere to show more save dialogs 18:32:30 it does something like that with popups 18:33:31 https://arstechnica.com/information-technology/2016/06/under-new-management-sourceforge-moves-to-put-badness-in-past/ ...I wonder how that went 18:33:52 I haven't touched the site since 2015. 18:37:44 Good Night 18:38:09 [[R + S]] https://esolangs.org/w/index.php?diff=154743&oldid=154725 * Stkptr * (+62) Combinational, no category for that 18:48:03 also large sizes reminds me, https://sqlite.org/limits.html says that in theory sqlite can handle databases as large as 256 tebibytes, but “This particular upper bound is untested since the developers do not have access to hardware capable of reaching this limit.” 18:48:44 these days 256 tebibytes file size should be reachable so they might be able to test it 18:50:30 date announced, SIGBOVIK conference is on 2025-04-04 http://sigbovik.org/2025/ 19:07:27 hmm, if a server did have 256 TiB of storage, how long would it take to fill it all? 19:07:43 I guess it wouldn't even be that long, given that it's only TiB, not PiB or XiB 19:08:04 people do gigabyte-scale things all the time, this is only 1000 times as much 19:22:28 The other possibility might be to make up a VFS to make up the data as it is being read, if it can be made up according to the proper file format and trees 19:28:27 it might not be very fast, but I don't think that's a problem here 19:52:25 [[User:HiIam]] M https://esolangs.org/w/index.php?diff=154744&oldid=131148 * HiIam * (+79) Well, it's fine... I guess. 19:54:01 [[User:HiIam]] https://esolangs.org/w/index.php?diff=154745&oldid=154744 * HiIam * (+4) Not a big change... 20:05:23 [[Funciton]] https://esolangs.org/w/index.php?diff=154746&oldid=154395 * Timwi * (+169) Regular expressions: add (used in https://www.youtube.com/watch?v=Nt_8O7ZHmFQ), and change layout 20:39:07 [[Language list]] M https://esolangs.org/w/index.php?diff=154747&oldid=154731 * Buckets * (+16) 20:40:01 [[User:Buckets]] M https://esolangs.org/w/index.php?diff=154748&oldid=154708 * Buckets * (+15) 20:40:16 [[```]] M https://esolangs.org/w/index.php?diff=154749&oldid=154713 * Kaveh Yousefi * (+0) Amended a word's case to its minuscular form. 20:40:18 [[Misprefix]] N https://esolangs.org/w/index.php?oldid=154750 * Buckets * (+653) Created page with "Misprefix is an Esoteric programming language created by [[User:Buckets]] in 2024. {| class="wikitable" |- ! Commands !! Instructions |- | Cre- || Create a New command. |- | Ed- || Name the Newest command. |- | Je- || End the Naming process. |- | Yon- || Set the speci 20:42:41 [[Talk:Burn]] https://esolangs.org/w/index.php?diff=154751&oldid=153081 * BestCoder * (+67) 20:48:20 [[Template:Stubnoinfo]] https://esolangs.org/w/index.php?diff=154752&oldid=129874 * Ractangle * (+43) 20:55:26 [[Misprefix]] M https://esolangs.org/w/index.php?diff=154753&oldid=154750 * Buckets * (+211) 21:04:37 [[Abba]] M https://esolangs.org/w/index.php?diff=154754&oldid=152646 * Buckets * (+9) 21:04:51 [[Abba]] M https://esolangs.org/w/index.php?diff=154755&oldid=154754 * Buckets * (+0) 21:13:43 [[Talk:Uhidklol]] https://esolangs.org/w/index.php?diff=154756&oldid=154154 * Juanp32 * (+302) 21:28:32 [[Talk:ight]] M https://esolangs.org/w/index.php?diff=154757&oldid=148910 * Buckets * (+283) 21:36:17 [[Happy]] M https://esolangs.org/w/index.php?diff=154758&oldid=154343 * Buckets * (+35) 21:43:16 [[Misprefix]] M https://esolangs.org/w/index.php?diff=154759&oldid=154753 * Buckets * (-1) 21:51:01 [[Sleep.]] M https://esolangs.org/w/index.php?diff=154760&oldid=154456 * Buckets * (+66) 21:57:58 [[Talk:ight]] M https://esolangs.org/w/index.php?diff=154761&oldid=154757 * Buckets * (-19) 22:02:19 -!- tromp has quit (Quit: My iMac has gone to sleep. ZZZzzz…). 22:40:02 [[PTL]] M https://esolangs.org/w/index.php?diff=154762&oldid=117645 * Buckets * (+0) /* Truth machine */ 23:43:47 -!- craigo has quit (Read error: Connection reset by peer). 23:43:57 -!- craigo has joined. 23:54:23 [[BitTurn]] https://esolangs.org/w/index.php?diff=154763&oldid=150583 * Stkptr * (+358) 23:56:52 [[Albuqer chng]] https://esolangs.org/w/index.php?diff=154764&oldid=148764 * Stkptr * (+28) 23:59:10 [[Domino]] https://esolangs.org/w/index.php?diff=154765&oldid=54408 * Stkptr * (+24) Unknown class 23:59:37 [[EISC]] https://esolangs.org/w/index.php?diff=154766&oldid=37959 * Stkptr * (+23)