<<Prev Next>> Scroll to Bottom
Stuff goes here
L1[00:00:22] <Hawk777> Since cable doesn’t have any delay, and ICs I think have one tick of delay from input to output.
L2[00:00:31] <Ne​uro> yes, but somehow the inputs turn off at t=0 as well
L3[00:00:36] <Hawk777> Oh, how do you know that?
L4[00:00:44] <Ne​uro> because the circuit doesnt work lol
L5[00:00:49] <Ne​uro> otherwise it would
L6[00:01:04] <Hawk777> Oh, I thought your complaint was that the latches reading the inputs recorded the OFF state, which would happen if the inputs turned off at t=1 but ordered-before the latches becoming opaque.
L7[00:01:17] <Ne​uro> they seem to be yeah
L8[00:01:22] <Ne​uro> sorry maybe I misunderstand you
L9[00:02:11] <Hawk777> Right. So if at t=0, the outputs turn off first and then the latches become transparent, then we have the propagation delay, then at t=1 the inputs turn off first, the latches see their data lines go low, and then the latches become opaque, then the latches would record low.
L10[00:02:20] <Hawk777> Even though the outputs only changed at t=1.
L11[00:02:22] <Hawk777> *inputs
L12[00:02:28] <Ne​uro> ah I see now
L13[00:02:31] <Hawk777> (outputs changed at t=0, inputs at t=1)
L14[00:02:31] <Ne​uro> I get what you were talking about
L15[00:02:36] <Ne​uro> cause the tlatch records on falling edge
L16[00:02:39] <Hawk777> Exactly.
L17[00:02:56] <Ne​uro> and even though this all happens in an instant in ingame time
L18[00:03:03] <Hawk777> So if the falling edge of control and the falling edge of data arrive on the same tick, but the falling edge of data is ordered-before the falling edge of control, then the latches record low.
L19[00:03:16] <Ne​uro> the simulated time seems to choose to propagate those linked inputs and outputs in its own internal time
L20[00:03:30] <Ne​uro> ok so all I need is a latch that records on rising edge
L21[00:03:30] <Ne​uro> hmm
L22[00:03:39] <Hawk777> That’s a latch with a NOT gate in its control line.
L23[00:03:51] <Ne​uro> yeah that's first thing that came to mind
L24[00:03:58] <Hawk777> In fact a flip flop (aka edge-sensitive latch) is just two level-sensitive latches in a row, one with the control input inverted.
L25[00:05:00] <Ne​uro> yeah the tlatch recording on falling edge bit was the bit I didnt get
L26[00:05:07] <Ne​uro> I saw it as recording on rising edge
L27[00:05:26] <Ne​uro> you have to understand, I have no "normal" education in these things, the word "transparent latch" means nothing to me inherently
L28[00:05:34] <Ne​uro> but I looked it up and yeah, makes sense it records on fall
L29[00:05:57] <Ne​uro> you have to understand, I have no "normal" education in these things, the word "transparent latch" means nothing to me inherently beyond what I have experienced in projectred. [Edited]
L30[00:07:04] <Ne​uro> it's still confusing though because as you say yourself, this is all simulated time
L31[00:07:15] <Ne​uro> an in-IC pulse former doesn't actually propagate a pulse through minecraft time
L32[00:07:30] <Ne​uro> but somehow it still chooses to simulate the connected inputs and outputs
L33[00:07:49] <Ne​uro> well anyway, I am checking if it works
L34[00:08:51] <Hawk777> It does though, doesn’t it? An in-IC pulse former sets its output high at t=0 and then low at t=1?
L35[00:09:19] <Hawk777> It doesn’t have a propagation delay, in the sense that it sets its output high immediately when its input goes high. But it still sets its output *low* one tick later, I think.
L36[00:10:56] <Ne​uro> maybe it does I suppose. That would have other, more irritating ramifications though
L37[00:11:17] <Hawk777> Well, if it *didn’t* do that, then an IC with nothing but a pulse former in it would never produce any output at all.
L38[00:11:31] <Hawk777> Since the pulse would be zero time wide, and therefore not exist in the outside world.
L39[00:11:34] <Ne​uro> suppose thats an easy enough test
L40[00:12:07] <Ne​uro> although they might catch that specifically somehow
L41[00:12:42] <Ne​uro> nah it works so you are most likely right
L42[00:12:44] <dequbed> Hawk777: Hey now, the laplace impulse *has* a nonzero energy level so it affects real world with zero width :P
L43[00:14:45] <Hawk777> Hah.
L44[00:18:01] <Ne​uro> well
L45[00:18:12] <Ne​uro> inverting the latch input doesn't work because of other reasons
L46[00:18:16] <Ne​uro> but I can work from that at least
L47[00:18:20] <Ne​uro> thx
L48[00:18:30] <Ne​uro> (sorry latch control)
L49[00:24:15] <Ne​uro> aa im gonna have to do something stupid for this. dont like when I have to do stupid things
L50[00:24:20] <Hawk777> Yeah, I’m not sure whether you could actually build a reliable flip flop by putting two latches in front of each other with one control signal inverted in PR.
L51[00:24:30] <Hawk777> IRL it works, but not sure in PR.
L52[00:24:48] ⇦ Quits: Vexatos (~Vexatos@port-92-192-131-75.dynamic.as20676.net) (Quit: Insert quantum chemistry joke here)
L53[00:24:55] <Hawk777> I think in PR it would run into the same problem.
L54[00:25:12] <MichiBot> @Ariri REMINDER: look at articles from Izaya
L55[00:27:04] <Ne​uro> just need to make a latch that stores on high. will probably have to cook up some nonsense for that but certainly possible
L56[00:27:13] <Mimiru> %test
L57[00:27:13] <MichiBot> Mim​iru: Success
L58[00:27:16] <Kristo​pher38> Oh boy what a lengthy discussion
L59[00:28:14] <Ne​uro> just me having troubles with the consequences of my own silly decisions
L60[00:28:49] <Ne​uro> it would be very easy to implement an external controller for this
L61[00:28:59] <Ne​uro> but as noted, that's an extra 2 ticks of delay
L62[00:29:45] <Ne​uro> so instead each memory line access gate contains its whole own bunch of circuitry that syncs with all the others as they each independently figure out who gets to go
L63[00:30:09] <Ne​uro> which is as stupid as it sounds and totally not how you would do it in anything real but it is faster
L64[00:33:54] <Kristo​pher38> Wait what do you mean "sync with all the others"
L65[00:34:01] <Ne​uro> its a bit wierd
L66[00:34:03] <Ne​uro> but essentially
L67[00:34:13] <Ne​uro> each gate knows which gates want to go
L68[00:34:31] <Ne​uro> they then all figure out who wins, and that gate immediately opens itself
L69[00:34:49] <Ne​uro> it then also broadcasts that it won, which allows every other gate to update its internal memory and cycle again figuring out who wins
L70[00:34:59] <Ne​uro> (wins = gets to open)
L71[00:35:06] <Kristo​pher38> What do you mean "go"
L72[00:35:25] <Ne​uro> requesting a memory operation (read or write)
L73[00:35:28] <Kristo​pher38> Your terminology is so confusing sometimes
L74[00:35:59] <Ne​uro> well, I make all these things up myself
L75[00:36:05] <Ne​uro> so I don't really need concrete terminology
L76[00:36:14] <Ne​uro> and all the terminology I do have is well, made up myself
L77[00:36:41] <Ne​uro> but basically the gates control access from these 9 lines to the memory lines (addr line, input line, output line, and write control) https://tinyurl.com/yfqaz3ld
L78[00:36:59] <Ne​uro> obviously, they need to take turns in some fashion, or things wont exactly work out
L79[00:38:23] <Ne​uro> thats the base level problem at least
L80[00:40:33] <Ne​uro> now if you use an external controller chip, the flow goes something like this:
L81[00:40:33] <Ne​uro> chip decides which gate to open and sends signal -> gate opens (2 ticks) -> memory address decodes (2 ticks) -> memory cell activates (2 ticks) -> done
L82[00:41:35] <Ne​uro> now if you use an external controller chip, the flow goes something like this:
L83[00:41:35] <Ne​uro> chip decides which gate to open and sends signal (2 ticks) -> gate opens (2 ticks) -> memory address decodes (2 ticks) -> memory cell activates (2 ticks) -> done [Edited]
L84[00:42:31] <Ne​uro> if the gates decide for themselves, in a sense, because they share the IC with the gate circuit and so dont take 2 ticks to get it to open, saves some ticks
L85[00:42:55] <Ne​uro> (well, 2, to be exact)
L86[00:45:32] <Hawk777> I believe you may be designing an “arbiter”. That’s a device that accepts a number of requests and grants exactly one of them at a time.
L87[00:45:32] <Ne​uro> technically win signalling isnt even needed: that would have been really clever and incomprehensibly extra, but didn't turn out to be possible
L88[00:45:48] <Ne​uro> Sure, sounds like an accurate enough description
L89[00:46:31] <Hawk777> I made one myself in a single IC, to ensure that only one power generator at a time would run since I don’t have transmission/storage capacity for more than that.
L90[00:46:39] <Ne​uro> I mean, I can't think of another way to allow more than one line to access memory, I have put some thought into somehow having simultaneous access or some sort of schemas to allow for that/other weird design decisions, but havent come up with much before this
L91[00:46:55] <Ne​uro> I mean, I can't think of another way to allow more than one line to access memory, I have put *some* thought into somehow having simultaneous access or some sort of schemas to allow for that/other weird design decisions, but havent come up with much asides from this [Edited]
L92[00:47:35] <Ne​uro> this was the arbiter (if you wanna call it that) for the old design https://tinyurl.com/yfr9g5mc
L93[00:48:10] <Ne​uro> it used a specific control chip to choose which of four sets of gates to open (the control chip is the one just a tad left of the hand)
L94[00:48:52] <Ne​uro> but it would be wise to not think of this in non-minecraft (/non projectred) terms, because in the context of non-minecraft, this design is incomprehensibly stupid
L95[00:49:03] <dequbed> Hawk777: inb4 you start designing your own hardware to run your own software stack on since you refuse to make any sort of tradeoff ever. :P
L96[00:49:05] <Ne​uro> it's only the quirks of projectred instant ICs that make it an optimal design
L97[00:49:37] <Hawk777> Yep, it is its own slightly strange world.
L98[00:50:57] <Ne​uro> dequbed: I do this for fun, obviously I am gonna push towards new and strange ways of doing things, especially if I have implemented a more "traditional" design before
L99[00:51:59] <Ne​uro> and hey, if they happen to be optimal in the weird and wacky world of simulated minecraft redstone: even better
L100[00:54:21] <dequbed> Hey if you ever implement binding in hardware poke me :P
L101[00:54:41] <Ne​uro> def binding in this context
L102[00:55:02] <dequbed> linking on the non-existant abstraction level of computing you're working in.
L103[00:55:29] <Ne​uro> . . sorry i'm not smart enough to understand that sentence
L104[00:55:30] <Ne​uro> clearly
L105[00:56:08] <dequbed> Linking is the last step of compilation to get a final loadable process image (or "executable") out of code.
L106[00:56:57] <Ne​uro> I'm not going to be making hardware level compilation lol
L107[00:56:59] <dequbed> But linking generally works on abstraction levels of like you have an OS and something that looks almost like a cpu and a main bus if you squint hard enough.
L108[00:57:37] <Ne​uro> I will be writing programs externally, most likely with the help of some software I will write, compiling that to raw memory, and writing it to memory via opencomputers
L109[00:57:44] <Ne​uro> but well, that is some ways into the future
L110[00:57:51] <Ne​uro> I will be writing programs externally, most likely with the help of some software I will write, compiling that to raw memory data, and writing it to memory via opencomputers [Edited]
L111[00:57:54] <dequbed> If you work on abstraction level of "I pay Burroughs several thousand bucks per month" then you don't have linking, you have binding :P
L112[00:58:14] <Hawk777> In case you’re curious, https://paste.pics/c6a85123119c84b1dd554663f8e32156 is my 8-resource arbiter. It’s not quite a traditional arbiter because each resource has both a request input (I want this) and a hold input (I want to keep the grant if I have it, but not gain it if I don’t), but you might get some inspiration.
L113[00:58:31] <Ne​uro> what is the double s thing
L114[00:58:47] <Ne​uro> odd that I dont recognize that cause, well, I have done a lot of projectred lol
L115[00:59:05] <Ne​uro> the ones in the second row
L116[00:59:24] <dequbed> alternative configuration of a SR latch iirc
L117[00:59:32] <Ne​uro> lemme check
L118[00:59:41] <Ne​uro> ah yeah, weird
L119[00:59:45] <Ne​uro> thanks, it looks cool
L120[01:00:03] <Ne​uro> as mentioned, I have made a traditional 4-resource arbiter before, in which those output signals would just be sent to IC gates
L121[01:00:16] <Ne​uro> altho it doesn't have "hold" capacity
L122[01:00:24] <Ne​uro> just 4 requests, one output
L123[01:00:26] <Ne​uro> let me find that
L124[01:01:22] <Ne​uro> hmm no, I will need to load the world
L125[01:01:38] <Hawk777> Yeah just requests and grants is the normal case. I just wanted this for my specific use case.
L126[01:01:44] <Ne​uro> but regardless the idea with this design is each individual IC gate has its own control circuitry and so opens (or doesn't) itself
L127[01:02:44] <Hawk777> Yeah, that makes sense, it just might be easier to do the arbiter all in one IC rather than spread out.
L128[01:03:06] <Ne​uro> what I cannot figure out is what the decision trigger for your arbiter is, is it on low of the current grant?
L129[01:03:27] <Ne​uro> >Hawk777: Yeah, that makes sense, it just might…
L130[01:03:27] <Ne​uro> oh it absolutely would be haha. no question there
L131[01:03:55] <Ne​uro> https://tinyurl.com/yffvl93c
L132[01:03:55] <Hawk777> There’s a timer over on the far right hand side.
L133[01:04:13] <Ne​uro> ah missed that, so time based
L134[01:04:18] <Hawk777> Each time the timer ticks it re-evaluates the situation.
L135[01:04:28] <Ne​uro> this one is signal based, and iterates on every high of the bottom left line
L136[01:04:30] <Hawk777> For me I’m controlling power generators so the timer ticks every second, which is far faster than it needs to be.
L137[01:04:39] <Hawk777> But you sound like you’re building a computer or something, so that’s probably way too slow.
L138[01:04:58] <Ne​uro> I don't use timers or clocks because I'm insane
L139[01:05:20] <Ne​uro> only relative delays (like repeaters) or just state based systems
L140[01:05:34] <Hawk777> Personally I avoid them as much as I reasonably can, because I assume it’s possibly maybe more efficient (in terms of lag impact on my real-world computer), but I use timers if avoiding them would be too much of a PITA.
L141[01:06:00] <Ne​uro> either way this simply round-robins the current requests on every iteration of the rs input
L142[01:06:06] <Amanda> %choose rain box or continue poking terraform
L143[01:06:07] <MichiBot> Ama​nda: Haven't you always gone with "continue poking terraform"? Hm, maybe not.
L144[01:06:08] <Ne​uro> which is an input from the memory control circuitry saying "done"
L145[01:06:50] <Ne​uro> its a bit weird of a design and I could probably improve it a lot, made it a while ago
L146[01:06:53] <Ne​uro> but it works
L147[01:08:03] <Ne​uro> the new design is uhh . . insane
L148[01:08:06] <Hawk777> Fair. My arbiter I pasted is strict priority (higher wire colours always win in the case of multiple requests), which is also what I wanted, so that in the event of a power generation request coming in while multiple generators were ready to go (i.e. sufficient fuel available), it would choose the one I want to burn first.
L149[01:08:50] <Ne​uro> but essentially the gates each simultaneously figure out whether they are the rightmost request on this strip https://tinyurl.com/ydkjok73
L150[01:09:09] <Ne​uro> and then once the winner wins, the strip is rotated such that they are on the leftmost spot
L151[01:09:43] <Ne​uro> & process repeats
L152[01:11:11] <Ne​uro> (the strip "rotates" as if its two ends were glued together to form a loop.)
L153[01:12:29] <Hawk777> Hm, so did you basically build a copy of the whole arbiter in each chip, and then only used one of its outputs? I suppose that is one way of not having a separate arbiter chip :D
L154[01:12:57] <Ne​uro> well yes, if you cannot use a second chip, how else is one supposed to?
L155[01:15:07] <Hawk777> I figured it might be possible to do something like pass summary information back and forth between chips, something like a loop around which the grant flows, such that you could make an arbiter of unlimited length by just stacking individual components side by side.
L156[01:15:22] <Ne​uro> of course, but again, propagation delay
L157[01:15:23] <Hawk777> Rather than having every arbiter evaluate *all* the inputs, it would evaluate its own, and its neighbours would provide summaries of the others.
L158[01:15:25] <Hawk777> Yeah, that.
L159[01:15:42] <Hawk777> I never quite figured out how to do it reliably, and eight inputs was plenty for me.
L160[01:16:31] <Ne​uro> this is a simple arbiter besides, it is only reading ones and returning a simple output
L161[01:16:39] <Ne​uro> not evaluating conditions or the like
L162[01:16:53] <Ne​uro> or multiple output allocation or other fancy things that one might gain some use from
L163[01:17:01] <Hawk777> Right, I was just thinking of a way to expand it to more resources than there are I/Os available in a single IC.
L164[01:17:15] <Ne​uro> yes, if you needed to arbitrate that many inputs
L165[01:17:51] <Ne​uro> first thing that comes to mind is simply meta-arbitration but that is the boring solution
L166[01:18:04] <Ne​uro> im sure something clever as you describe could be made to work
L167[01:19:37] <Hawk777> Meta-arbitration as in ORing all the requests in a group together, arbitrating the groups, and ANDing the requests with the group grant before granting the individual resources?
L168[01:19:58] <Ne​uro> yes, just arbitrate which group of inputs to arbitrate first
L169[01:20:09] <Ne​uro> then pass that into an individual chip
L170[01:20:48] <Hawk777> Still need to be rather careful about timing, I guess, to avoid races if multiple inputs go high or low at once, but yeah, I see it could work.
L171[01:21:19] <Ne​uro> races are always a problem yeah
L172[01:21:40] <Ne​uro> if I could somehow magic away races the entire design I just described (the new one) could be approx 100x simpler
L173[01:21:49] <Ne​uro> but I cannot
L174[01:21:56] <Hawk777> If you could somehow magic away races, I think you could be a very, very rich person!
L175[01:22:02] <Hawk777> (if you could do it in real-world programming)
L176[01:22:09] <Ne​uro> haha well that too
L177[01:24:16] <Ocawes​ome101> solution: cooperative multitasking, no parallelism whatsoever
L178[01:24:20] <Ne​uro> (tbh, it could have been "kicked down the road" in the sense of kicking it down to the requesting entities, which I could have build clocks to synchronize or other methods, perhaps even not requiring any control on the memory side at all, but I decided not to go that route)
L179[01:24:22] <Ocawes​ome101> :)
L180[01:26:02] <Hawk777> Fair. Cooperative multitasking magics away the races, while also magicking away the performance of multicore!
L181[01:26:40] <Ne​uro> now the problem is
L182[01:26:56] <Ne​uro> if I ever make a third minecraft redstone computer, it's gonna be hard to top this in terms of ridiculous designs
L183[01:27:12] <Hawk777> I am babby. I have not even made one redstone computer.
L184[01:27:56] <Ne​uro> I will probably have to finally find a way to implement my dream of multiple data accesses being able to happen in parallel
L185[01:28:00] <Ne​uro> without strict sectioning/windowing
L186[01:28:25] <Ne​uro> (ie they can happen in parallel and the memory ranges they can access are identical)
L187[01:28:41] <Ne​uro> altho dont ask me how the fuck i'm gonna manage that cause I have no clue
L188[01:29:26] <Hawk777> So, dual-port RAM?
L189[01:29:46] <Ne​uro> obviously the standard row/column address decoding method doesn't exactly work
L190[01:29:49] <Hawk777> https://en.wikipedia.org/wiki/Dual-ported_RAM
L191[01:30:08] <Ne​uro> yes, I know real systems of the type exist
L192[01:30:12] <Ne​uro> don't 100% know how they work tho
L193[01:30:48] <Hawk777> Might be able to find out.
L194[01:30:51] <Ne​uro> (also even the wikipedia page says "nearly at the same time" so is it really simultaneous or just caching requests and doing them sequentially lightning fast?)
L195[01:31:10] <Hawk777> “at the same time, or nearly the same time”
L196[01:31:25] <Ne​uro> Of course, although I don't like to base my designs on pre-existing stuff usually
L197[01:31:57] <Ne​uro> >Hawk777: “at the same time, or nearly the same…
L198[01:31:57] <Ne​uro> yeah ofc, but it could be one of those things where the technical truth has become softened/muddied somewhat, and you get a more wishy-washy statement like that. I mean, it is a stub, not an in-depth technical article
L199[01:32:22] <Hawk777> I know I have used some hardware which has dual-ported RAM that, if I remember correctly, has two separate clock inputs, which can be completely asynchronous, or could be exactly the same signal, and you can do the operations on every clock cycle.
L200[01:32:50] <Hawk777> It was a Xilinx FPGA.
L201[01:32:58] <Ne​uro> can it handle collisions? are you expected to manage those on your own?
L202[01:33:19] <Hawk777> I can’t remember what it does if you write to the same address twice at the same time. It might be undefined, or it might have a defined result.
L203[01:33:57] <Ne​uro> regardless you also have to consider the second part of the challenge: in minecraft
L204[01:34:04] <Hawk777> Yes :D
L205[01:34:33] <Ne​uro> if I had more than four i/o sides, it is not impossible to envisage a system whereby you send two separate address encodings through the same grid, and a chip sends outputs/writes inputs from a pair of its four sides depending on said input
L206[01:34:44] <Hawk777> Pretty sure it *did* have a defined result for reading and writing the same address at the same time using the same clock signal.
L207[01:34:51] <Ne​uro> but well, now I need at least 5 i/o sides, or to store less than 16 bits in the chip
L208[01:36:00] <Ne​uro> I suppose making such a system even with 8bit (or maybe a non-standard inter power word length) would still be quite interesting
L209[01:36:39] <Ne​uro> infact no it would be trivial since you could just use high/low of each 16bit bus for each channel
L210[01:36:47] <Ne​uro> well no, trivial is a bit much phaps
L211[01:36:53] <Ne​uro> but can vaguely map it out
L212[01:37:14] <Ne​uro> would also still have conflict problems
L213[01:37:48] <Ne​uro> although I suppose there is no right answer in a conflict anyway so you only need to define a consistent outcome, which is also not too hard
L214[01:38:40] <Hawk777> Or define it as undefined behaviour!
L215[01:38:52] <Ne​uro> yes, the easy way out. haha
L216[01:38:52] <Hawk777> After all, it would be rare that software would want to do that and rely on a useful outcome.
L217[01:39:12] <Ne​uro> one of those things where you can pass the buck to the programmer haha
L218[01:40:11] <Hawk777> Minecraft is much nicer than real life in one way, namely the entire universe has a single discrete timebase—no asynchronous clocks, no metastability, etc..
L219[01:41:37] <Ne​uro> I was thinking, when I was originally designing the general layout of the computer (which, if it means anything to you, dequbed described as some kind of CPLD) that like "wait, this could enter infinite loops and the like really easily" and then I was like "wait but I suppose you can also trivially program infinite loops into C, so it's just on the programmer to well, not write infinite loops (or on the compiler to not generate them"
L220[01:41:56] <Hawk777> hahaha
L221[01:42:17] <Hawk777> Hm, I have not used a CPLD myself, but I understand they are quite similar to FPGAs, which sounds fun.
L222[01:43:27] <Ne​uro> the design is just an 8 by 8 grid of individual processing units which receive and send data to one another
L223[01:44:12] <Hawk777> Reminded of TIS-100, a grid of simple processing units with interconnect!
L224[01:44:31] <Ne​uro> TIS-100 is amazing
L225[01:44:47] <Ne​uro> although, ironically, I do not remember being particularly inspired by it
L226[01:44:48] ⇦ Quits: Inari (~Pinkishu@p4fd95b4d.dip0.t-ipconnect.de) (Quit: KVIrc 5.0.0 Aria http://www.kvirc.net/)
L227[01:45:02] <Ne​uro> I was mainly thinking along the lines of like, how to create something, hmm, instruction efficient
L228[01:45:33] <Ne​uro> because a cell can of course implement its instruction many to infinite times in a row
L229[01:45:57] <Ne​uro> as a whole probably more analogous to a co-processing chip than a CPU as you would know it
L230[01:46:00] <Hawk777> I think my only annoyance with TIS-100 was the fact that comments count against code size and you sometimes have to write really short jump target labels to fit them plus an instruction within a line.
L231[01:46:04] <Hawk777> Other than that I loved it.
L232[01:46:31] <Ne​uro> I don't think i've disliked a single zachtronics game
L233[01:47:28] <Ne​uro> shenzhen io is great, exapunks is great, opus magnum is great (altho mega cheesable but lets not get into that), tis-100 is great, spacechem is great (at turning your brain into mush) etc
L234[01:48:33] <Hawk777> I played a bit of Shenzhen I/O, a fair bit of Opus Magnum, and all of TIS-100 with the possible exception of one of the additional library challenges (can’t remember if I eventually solved it much later, or never). All fun!
L235[01:48:35] <Ne​uro> oh i forgot infinifactory
L236[01:48:36] <Ne​uro> also great
L237[01:49:34] <Ne​uro> (the opus magnum cheese btw is a flaw in how the "generate an infinite chain" missions are set up, which lets you do funny/fucky things)
L238[01:49:36] <Ne​uro> like this: https://www.youtube.com/watch?v=_whkJ1fSk6Q
L239[01:49:38] <MichiBot> Opus Magnum- Armor Fillament- Restricted Solution | length: 1m 4s | Likes: 6 Dislikes: 0 Views: 590 | by Riokaii | Published On 5/11/2017
L240[01:51:15] <Ne​uro> it thinks the chain is being endlessly added onto because each time it passes the output block it is longer by one
L241[01:51:28] <Ne​uro> and then once it detects that enough times its like: "ok you win"
L242[01:51:45] <Ne​uro> honestly hilarious
L243[01:55:49] <Hawk777> hahahaha
L244[02:00:30] <Ne​uro> >Hawk777: I think my only annoyance with TIS-10…
L245[02:00:31] <Ne​uro> exapunks is like this too
L246[02:00:43] <Ne​uro> having to make the names of everything really short of character restriction reasons
L247[02:00:46] <Ne​uro> bit irritating
L248[02:01:16] <Ne​uro> pretty much all your "JMP X" need to be single character otherwise it gets tough
L249[02:01:30] <Hawk777> Yeah, I’m mainly annoyed by it because it’s unrealistic. Comments get removed by the compiler or assembler—you can write an essay in comments and it doesn’t affect the generated machine code. Same with labels.
L250[02:02:16] <Ne​uro> yes, ofc
L251[02:03:02] <Ne​uro> I guess you could say the TIS (and uh, whatever the exapunk bot thingies are) dont have compilers (or have comically minimal ones) and you are writing just like raw instructions
L252[02:03:43] <Ne​uro> that said, I suppose realism is not the ultimate goal. I think most people here can attest that Spacechem isn't how chemistry ultimately works 😛
L253[02:04:07] <Ne​uro> (well, maybe oneday)
L254[02:04:13] <Hawk777> I suppose it could be something more like an interpreted language.
L255[02:05:03] <Hawk777> But… an interpreted language, that looks like assembly language, that runs on a raw CPU… weird :D
L256[02:18:29] <Kristo​pher38> One like and I'm doing native lua CPU for an fpga course project
L257[02:20:16] <Hawk777> WAT
L258[02:20:28] <Hawk777> A CPU that natively executes text seems… really really crazy.
L259[02:20:43] <Hawk777> Unless you mean binary Lua?
L260[02:20:59] <Ne​uro> I imagine almost certainly they mean some sort of binary compiled lua
L261[02:21:07] <Kristo​pher38> No I mean lua bytecode
L262[02:21:10] <Ne​uro> also there's your like
L263[02:21:11] <Ne​uro> have fun
L264[02:21:39] <Hawk777> Ah OK.
L265[02:22:08] <Hawk777> Anyone remember Jazelle, the execution mode of ARM CPUs that would execute Java bytecode?
L266[02:23:24] <Kristo​pher38> At least I'd want to have it work as some sort of accelerator, where the CPU requests to run some Lua code and the FPGA does it
L267[02:23:40] <Kristo​pher38> With at least some opcodes supported
L268[02:24:31] <Hawk777> Apparently, though little is publicly documented, that’s pretty much how Jazelle worked. The CPU implemented some instructions and gave up and let the software implement others.
L269[02:24:31] <Ne​uro> >Hawk777: Anyone remember Jazelle, the executio…
L270[02:24:31] <Ne​uro> sounds like a mess, reads like a mess haha
L271[02:25:23] <Ne​uro> honestly its even wierder than youd expect upon reading about it
L272[02:25:27] <Ne​uro> assuming wikipedia is correct
L273[02:25:54] <Hawk777> It seems absolutely insane to me to go to all the effort of implementing a bunch of hardware in a CPU, but then not document it publicly.
L274[02:26:02] <Ne​uro> it was a sort of extension to the main control flow by having a branch instruction that would branch somewhere then attempt to execute the branch as java
L275[02:26:35] <Hawk777> Well, that is also how you switch between e.g. ARM and Thumb modes (an interworking branch instruction), so not super weird.
L276[02:26:59] <Mimiru> %test
L277[02:26:59] <MichiBot> Mim​iru: Success
L278[02:27:03] <Mic​hiyo> %test
L279[02:27:03] <MichiBot> Mic​hiyo: No.
L280[02:27:09] <Mimiru> Ok, still looks good.
L281[02:27:20] <Amanda> %give MichiBot a tattoo gun loaded with cat scent
L282[02:27:22] * MichiBot accepts the tattoo gun loaded with cat scent and adds it to her inventory
L283[02:27:37] <Mimiru> mmhmm....
L284[02:27:40] <Ne​uro> true although arm to thumb is a bit less complex than arm to java
L285[02:27:41] <Ne​uro> lol
L286[02:27:45] * Amanda curls up around Elfi, goes to poke some animals
L287[02:59:29] <Kristo​pher38> @Neuro correct me if I'm wrong, but you don't use clocks since redstone is synchronous anyway, right?
L288[02:59:39] <Ne​uro> yes
L289[02:59:46] <Ne​uro> well, yes and no
L290[02:59:55] <Ne​uro> I still like to build signal instead of timing based
L291[03:00:06] <Ne​uro> that is to say, something might send a signal saying "im done" and then the process advances
L292[03:00:21] <Ne​uro> you can technically make everything just timings but its a bit boring
L293[03:00:39] <Ne​uro> but yeah, stuff i want fast, like memory, is gonna be based on timings
L294[03:01:02] <Ne​uro> and you can build clocked redstone computers, one of the few people to actually build a fabrication minecraft computer was a clocked one
L295[03:01:11] <Ne​uro> pipe told me about it ages ago, not gonna bother digging it up sorry
L296[03:05:46] <Ne​uro> this design also does have a "clock" of sorts but its more for synchronizing specific aspects of different elements
L297[03:06:02] <Ne​uro> (specifically writeops between cells)
L298[03:06:08] <Ne​uro> so not something the entire machine runs on
L299[03:07:16] <Kristo​pher38> I see, so some sync is needed but not a global clock
L300[03:07:29] <Ne​uro> yeah, original design didnt have one
L301[03:07:31] <Ne​uro> then I added one in
L302[03:07:35] <CompanionCube> dequbed: ...burroughs? i associate that name with weird old mainframes emulated on modern systemd
L303[03:08:17] <Ne​uro> then I added one in/more like realized it was necessary [Edited]
L304[03:09:10] <Ne​uro> Then i toyed with removing it as you can see lol
L305[03:09:12] <Ne​uro> https://tinyurl.com/ye4b8lvh
L306[03:09:27] <Izaya> > emulated on modern systemd
L307[03:09:31] <Izaya> pls elaborate
L308[03:09:39] <Ne​uro> in the end I decided to keep it but slightly altered
L309[03:10:09] <Ne​uro> making a design without it would 100% be possible, just a bit messy
L310[03:10:21] <CompanionCube> Izaya: iirc literally just an emulator on x86
L311[03:10:35] <Izaya> oh
L312[03:10:38] <Izaya> why?
L313[03:10:45] <Ne​uro> also, as always, would have needed more bits. lmao
L314[03:10:47] <Izaya> also I imagine simh could do that
L315[03:11:27] <CompanionCube> ah yes
L316[03:11:41] <CompanionCube> burroughs is called unisys now
L317[03:12:20] <Ne​uro> >Neuro: also, as always, would have needed mo…
L318[03:12:21] <Ne​uro> I dont have a spare bit on the inter-cell talk line for "row/column in use" is the problem
L319[03:12:36] <Ne​uro> so a synchronizing clock that makes sure sends only happen one after the other is needed
L320[03:12:49] <Ne​uro> it also helps make a bunch of other things not super messy
L321[03:13:33] <Ne​uro> unfortunately propagation delay makes the clock unavoidably slow altho I have some planned alternate clock modes for dealing with stuff like that
L322[03:14:13] <CompanionCube> Izaya: https://en.wikipedia.org/wiki/Burroughs_large_systems yeah, latest models use Xeons.
L323[03:14:51] <Ne​uro> so now I get to know what dequbed was talking about
L324[03:14:52] <Ne​uro> lol
L325[03:15:55] <CompanionCube> probably just a coincidence
L326[03:16:03] <Izaya> disappointing, but I guess everyone converges on IBM PC clones eventually
L327[03:16:30] <Ne​uro> the IBM PC cycle
L328[03:16:36] <Ne​uro> there is only one step
L329[03:16:38] <CompanionCube> Izaya: on the plus side it does mean they offer a free downloadable version...
L330[03:16:46] <Ne​uro> and it is IBM PC
L331[03:17:07] <CompanionCube> iirc this is also one of those very rare platforms where two's complement isn't a thing
L332[03:34:49] <Ne​uro> aaaagh
L333[03:35:00] <Ne​uro> still havent cracked these stupid gate arbitrator thingys
L334[03:35:14] <Ne​uro> close, very close, but yet so far
L335[03:35:17] <Ne​uro> well, anyway. sleep time.
L336[03:35:35] <Ne​uro> it is like, too late AM rn
L337[04:02:45] * Amanda stops bothering the forest animals, uses elfi as a pillow and zzzmews
L338[04:02:52] <Amanda> Night nerds
L339[04:16:56] <Va​ur> %tonk
L340[04:16:58] <MichiBot> Dad-Sizzle! Va​ur! You beat Forec​aster's previous record of <0 (By 9 hours, 1 minute and 42 seconds)! I hope you're happy!
L341[04:16:59] <MichiBot> Vaur's new record is 9 hours, 1 minute and 42 seconds! Vaur also gained 0.00903 tonk points for stealing the tonk. Position #1.
L342[06:35:51] <lunar_sam> https://xmpp.icbmlaunch.site/upload/biQNNEijiZ0APhAM/7538bb58-c924-457e-a68b-7e01e5cb467b.png
L343[06:47:09] <Snai​lDOS> boeng
L344[07:16:39] <Izaya> boing
L345[07:17:39] <Ar​iri> bung
L346[07:50:58] <Ash​irg> %sip
L347[07:50:59] <MichiBot> You drink a fragrant honey potion (New!). Ashirg looks confused as nothing happens.
L348[07:51:22] <Va​ur> %sip
L349[07:51:23] <MichiBot> You drink a forked white potion (New!). Vaur turns into a sapphire unicorn boy until they see a star fall.
L350[08:07:28] ⇦ Quits: Hawk777 (~chead@2607:c000:8274:b100:cdca:bac8:814c:86ad) (Quit: Leaving.)
L351[08:15:43] <Ash​irg> %sip
L352[08:15:44] <MichiBot> You drink a fiery tomato potion (New!). A bard starts playing a lute behind Ashirg until they have a nap.
L353[08:29:56] <Va​ur> %sip
L354[08:29:57] <MichiBot> You drink a smooth tomato potion (New!). After the first sip the potion poofs away.
L355[09:26:14] <Ash​irg> %sip
L356[09:26:15] <MichiBot> You drink a hairy platinum potion (New!). It tastes bitter.
L357[10:15:23] ⇨ Joins: Inari (~Pinkishu@p508efb94.dip0.t-ipconnect.de)
L358[11:24:30] ⇦ Quits: lordpipe (~ba7888b72@66.109.211.50) (Ping timeout: 195 seconds)
L359[11:24:52] ⇨ Joins: lordpipe (~ba7888b72@66.109.211.50)
L360[11:32:28] ⇨ Joins: Vexatos (~Vexatos@port-92-192-131-75.dynamic.as20676.net)
L361[11:32:28] zsh sets mode: +v on Vexatos
L362[11:55:09] <Ash​irg> %sip
L363[11:55:10] <MichiBot> You drink a salty orange potion (New!). Ashirg turns into a sword horse until they have A Seeping Aegisalt potion.
L364[12:04:34] <Va​ur> %sip
L365[12:04:34] <MichiBot> You drink a cloudy lime potion (New!). Vaur shrinks by a negligible amount until someone looks at them.
L366[12:08:26] <Ash​irg> %sip
L367[12:08:27] <MichiBot> You drink a smooth rubium potion (New!). Ashirg barely manages to catch a red shell that appears in front of them!
L368[12:12:56] <Forec​aster> %sip smooth rubium potion
L369[12:12:58] <MichiBot> You drink a smooth rubium potion. Forecaster barely manages to catch a red shell that appears in front of them!
L370[12:13:04] <Forec​aster> %redshell Vaur
L371[12:13:08] <MichiBot> Forec​aster: Unfortunately you missed with a 13 vs 14.
L372[12:13:13] <Forec​aster> dammit!
L373[12:13:53] <Forec​aster> %shellcount
L374[12:13:54] <MichiBot> Forec​aster: You have 1 Blue Shell, 0 Red Shells, 0 Green Shells, and 2 Bricks
L375[12:28:18] <Va​ur> %sip
L376[12:28:18] <MichiBot> You drink a silent coral potion (New!). Vaur's bed is suddenly slightly less comfortable until they use "Crystal Nice" in a sentence.
L377[13:20:38] <Forec​aster> %tonk
L378[13:20:40] <MichiBot> Boom! Forec​aster! You beat Va​ur's previous record of 9 hours, 1 minute and 42 seconds (By 2 minutes)! I hope you're happy!
L379[13:20:41] <MichiBot> Forecaster's new record is 9 hours, 3 minutes and 42 seconds! Forecaster also gained 0.0003 (0.00003 x 10) tonk points for stealing the tonk. Position #2. Need 0.48808254 more points to pass Va​ur!
L380[13:28:55] ⇨ Joins: Renari (~Renari@64.67.31.239.res-cmts.bgr.ptd.net)
L381[13:30:53] ⇦ Quits: Arimil (~Renari@64.67.31.239.res-cmts.bgr.ptd.net) (Ping timeout: 192 seconds)
L382[13:39:15] ⇦ Quits: flappy (~flappy@91-154-0-54.elisa-laajakaista.fi) (Ping timeout: 195 seconds)
L383[14:00:50] ⇦ Quits: Renari (~Renari@64.67.31.239.res-cmts.bgr.ptd.net) (Ping timeout: 189 seconds)
L384[14:01:10] ⇨ Joins: Renari (~Renari@64.67.31.239.res-cmts.bgr.ptd.net)
L385[14:16:41] ⇨ Joins: ben_mkiv (~ben_mkiv@2001:16b8:1e99:3300:fe34:97ff:fea9:75f2)
L386[14:22:31] <basga​mer999> Can I get the invite somewhere!
L387[14:22:35] <basga​mer999> Can I get the invite somewhere? [Edited]
L388[14:26:43] <Ash​irg> %sip Seeping Aegisalt potion
L389[14:26:44] <MichiBot> You drink a seeping aegisalt potion (New!). After drinking the potion Ashirg notices a label that says "Side effects may include giggle fits and excessive monologuing."
L390[14:28:18] * Amanda checks on Elfi among her floof, making sure she didn't violate the rent agreement by building a patio or anything
L391[14:29:11] * Elfi is burrowed in floof with her laptop and a sketchbook instead, was too busy gamejamming to get into other mischief, zzzz
L392[14:29:42] * Amanda giggles, beams some snacks for elfi and a glass of water next to herseelf
L393[14:53:53] <dequbed> CompanionCube: This association would be correct. Burroughs aka the largest of the six dwarves of mainframe business. You may know them from the Burroughs Large Systems Architecture.
L394[14:57:06] <dequbed> Izaya: To elaborate on what CompanionCube already explained: a) because mainframes are stupid and a solution to a problem that should no longer exist. b) calling Mainframe emulators an "IBM PC clone" is an insult to the immense amount of engineering that went into them
L395[15:54:35] ⇨ Joins: djbjhfy (~djbjhfy@pool-100-15-96-211.washdc.fios.verizon.net)
L396[16:03:37] ⇦ Quits: djbjhfy (~djbjhfy@pool-100-15-96-211.washdc.fios.verizon.net) (Quit: Quit)
L397[16:23:47] ⇦ Quits: ben_mkiv (~ben_mkiv@2001:16b8:1e99:3300:fe34:97ff:fea9:75f2) (Quit: Leaving)
L398[16:32:19] <Ne​uro> . .
L399[16:32:38] <Ne​uro> of course the entirely illogical problem I was attempting to solve randomly disappears on relog
L400[16:32:52] <Forec​aster> hooray
L401[16:33:56] <Ne​uro> lol nope actually, it just decided to not appear the first time I tried after relog
L402[16:34:06] <Forec​aster> hooray
L403[16:34:14] <Ne​uro> was consistent before tho
L404[16:36:57] <Ne​uro> gonna try one of those classic fixes that have no logical reason to work but uhh, maybe?
L405[17:01:42] <Cyborg​Potato> %tonk
L406[17:01:42] <MichiBot> I'm sorry CyborgPotato, you were not able to beat Forecaster's record of 9 hours, 3 minutes and 42 seconds this time. 3 hours, 41 minutes and 2 seconds were wasted! Missed by 5 hours, 22 minutes and 39 seconds!
L407[17:07:25] ⇦ Quits: dmod (sid32492@ilkley.irccloud.com) (Remote host closed the connection)
L408[17:07:25] ⇦ Quits: Guest90172 (sid32492@ilkley.irccloud.com) (Remote host closed the connection)
L409[17:09:05] <Amanda> %choose seperate IoT SSID or just segment them once connected
L410[17:09:06] <MichiBot> Ama​nda: I've heard "seperate IoT SSID" is in these days
L411[17:19:14] ⇦ Quits: Teris (sid315557@helmsley.irccloud.com) (Ping timeout: 189 seconds)
L412[17:47:59] ⇨ Joins: ben_mkiv (~ben_mkiv@2001:16b8:1494:6900:fe34:97ff:fea9:75f2)
L413[17:54:18] <Izaya> Ariri, lunar_sam: https://ahhhhhh.social/media/cc79dc5c-f880-46be-8edb-eb0fafebff30/image.png
L414[17:54:48] <Izaya> dequbed: my point was it's disappointing that the hardware was gone. Emulators for old machines is always neat though.
L415[18:26:56] <dequbed> Izaya: I mean the hardware isn't "gone". Its just now using modern day hardware instead of decades outdated architectures designed for a completely different world of chip and electronics manufacture.
L416[18:34:40] * CompanionCube associates dequbed with high-performance things so the link with the e.g. b5000 was unexpected.
L417[18:39:49] <dequbed> CompanionCube: High-Performance and to a degree high-availability, which is mostly why I'm aware of the tech below mainframes. But what I do is more stuff like Erlang.
L418[18:54:44] ⇨ Joins: dmod (sid32492@id-32492.ilkley.irccloud.com)
L419[18:54:55] ⇨ Joins: Guest90172 (sid32492@id-32492.ilkley.irccloud.com)
L420[18:58:16] <Senl​iast> where can i find a list with key codes for the programming language?
L421[18:59:32] <Ne​uro> key codes?
L422[19:00:09] <Forec​aster> `string.byte("a")` gets you the character code
L423[19:00:59] ⇨ Joins: Teris (sid315557@id-315557.helmsley.irccloud.com)
L424[19:01:33] <Senl​iast> i mean, key codes for detecting key presses, like 28 for enter, etc.
L425[19:01:51] <Senl​iast> i need to detect spacebar press event
L426[19:02:31] <Forec​aster> see above, or make something that catches the event and prints the code, then press the button
L427[19:02:34] <Ocawes​ome101> the `key_down` event returns both the character code and the scancode
L428[19:02:34] <Forec​aster> or use dmesg
L429[19:02:49] <Senl​iast> ok, i will try...
L430[19:02:49] <Ocawes​ome101> so you can just check for character 32
L431[19:03:13] <Forec​aster> key codes aren't language specific by the way
L432[19:05:31] <Senl​iast> you have right, i just set up the "key_down" event and let the e4 show, for spacebar it was 57, thanks!
L433[19:07:56] <Ocawes​ome101> don't use that one
L434[19:07:58] <Ocawes​ome101> use the other one
L435[19:08:02] <Ocawes​ome101> e3 i think
L436[19:08:24] <Ocawes​ome101> otherwise if OC ever gets updated to 1.13+ your program will break (if that's a concern - which tbh it probably isn't)
L437[19:52:15] ⇦ Quits: TPG24 (~ThePiGuy2@host-92-17-127-228.as13285.net) (Ping timeout: 192 seconds)
L438[20:08:20] ⇨ Joins: ThePiGuy24 (~ThePiGuy2@host-92-17-127-228.as13285.net)
L439[20:08:52] <Forec​aster> %sip
L440[20:08:53] <MichiBot> You drink a boiling weather potion (New!). Gravity reverses for Forecaster until they see a star fall.
L441[20:09:00] <Forec​aster> oh dear
L442[20:11:04] <Ash​irg> %sip
L443[20:11:05] <MichiBot> You drink a sweet weather potion (New!). Ashirg gains an additional bone.
L444[20:11:10] <Ash​irg> Elfi do be cute tho
L445[20:25:45] ⇨ Joins: TPG24 (~ThePiGuy2@host-92-17-127-228.as13285.net)
L446[20:26:16] ⇦ Quits: ben_mkiv (~ben_mkiv@2001:16b8:1494:6900:fe34:97ff:fea9:75f2) (Remote host closed the connection)
L447[20:26:38] ⇨ Joins: ben_mkiv (~ben_mkiv@2001:16b8:1494:6900:fe34:97ff:fea9:75f2)
L448[20:27:20] ⇦ Quits: ThePiGuy24 (~ThePiGuy2@host-92-17-127-228.as13285.net) (Ping timeout: 189 seconds)
L449[20:40:32] ⇦ Quits: Renari (~Renari@64.67.31.239.res-cmts.bgr.ptd.net) (Ping timeout: 189 seconds)
L450[20:45:42] <Sagh​etti> https://tinyurl.com/yjfbbugk
L451[20:46:29] <Sagh​etti> pcb i made
L452[20:47:16] <Sagh​etti> this is a hardware password manager
L453[20:48:18] <Sagh​etti> basically a yubikey but for 2fa and password storage
L454[20:48:27] <Ocawes​ome101> neat
L455[20:52:10] <Ne​uro> neat
L456[20:59:42] <luna​r_sam> man
L457[20:59:48] <luna​r_sam> i wanna make custom PCBs and whatnot
L458[20:59:52] <luna​r_sam> have a few fun ideas
L459[20:59:55] <luna​r_sam> mostly dumb stuff
L460[21:00:26] <luna​r_sam> one was just
L461[21:00:28] <luna​r_sam> really dumb
L462[21:00:36] <luna​r_sam> icekey in discrete ICs
L463[21:03:28] <Va​ur> %sip
L464[21:03:29] <MichiBot> You drink a porous rainbow potion (New!). Vaur turns into an adamantium goat frog boy until the next time they hug someone.
L465[21:34:03] <Ar​iri> >Izaya: Ariri, lunar_sam: https://ahhhhhh.soc
L466[21:34:03] <Ar​iri> true
L467[21:38:09] <luna​r_sam> i love when my missiles fuck off to heaven in AC7
L468[22:02:18] <Amanda> %choose halucinate or continue poking the editor window
L469[22:02:18] <MichiBot> Ama​nda: The sands of time whisper to me... they're saying "halucinate".
L470[22:12:12] <luna​r_sam> i feel
L471[22:12:13] <luna​r_sam> very smug now
L472[22:12:21] <luna​r_sam> https://tinyurl.com/yefs5duh
L473[23:00:42] <Amanda> Elfi! Elfi! Lookit, I made a fairy-sized foxgirl! ~pushes Inari out of her hiding spot~
L474[23:00:48] <Elfi> :O
L475[23:00:53] <Elfi> She's tiny
L476[23:01:07] <Elfi> And bulliable >:3c
L477[23:08:43] <Inari> rude
L478[23:08:51] <Inari> %splash Amanda
L479[23:08:52] <MichiBot> You fling a smooth coral potion (New!) that splashes onto Amanda. An Apple sword appears next to Amanda.
L480[23:09:21] * Amanda noms the sword, to tell the audiance she's an even bigger asshole
L481[23:25:27] ⇦ Quits: Mimiru (~Michi@50.38.53.215) (Quit: Leaving)
L482[23:25:46] ⇨ Joins: Michi (~Michi@50.38.53.215)
L483[23:25:48] <Michi> damn it
L484[23:26:34] zsh sets mode: +o on Michi
L485[23:30:01] ⇦ Quits: Inari (~Pinkishu@p508efb94.dip0.t-ipconnect.de) (Quit: KVIrc 5.0.0 Aria http://www.kvirc.net/)
L486[23:30:40] <Forec​aster> %tonk and %sip
L487[23:30:40] <MichiBot> I'm sorry Forecaster, you were not able to beat Forecaster's record of 9 hours, 3 minutes and 42 seconds this time. 6 hours, 28 minutes and 58 seconds were wasted! Missed by 2 hours, 34 minutes and 44 seconds!
L488[23:30:41] <MichiBot> You drink a liquid violium potion (New!). Forecaster feels a sudden surge of static electricity.
L489[23:41:00] <Va​ur> %sip
L490[23:41:01] <MichiBot> You drink a still electrum potion (New!). Vaur's nails turn the color of dilithium until they see a bird.
L491[23:42:38] <Amanda> Michi: wrong button?
L492[23:43:34] <Michi> Tried to open a 2nd connection, instead opened said connection here
<<Prev Next>> Scroll to Top