@BrowncatPrograms If you don't plan to use SharedArrayBuffer then Safari should be fine (it's disabled by default for security reasons; it was also the case for Chrome and Firefox for a while, but they re-added it with a server-side restriction)
which also made me to move from GitHub Pages to Netlify, which supports custom response headers
@DLosc Indeed, the EsotericIDE Quipu interpreter does use unbounded integers, and computes 125! with ease. So for code golf submissions that require BigInts, "Quipu (EsotericIDE)" is a valid language. However, note that EsotericIDE doesn't let you remove the spaces between threads, so the bytecount will be higher.
@JoKing Follow-up question: do you want to post that solution as the factorial example program on Esolangs.org? It's much more straightforward than the current factorial program there, IMO.
[Try it online](https://tio.run/##nVdtb@I4EP7eX3FsFMUuKctLt1XRWZNPVZFWSGhXqlSETogm3RBIUJJq70D89t7YBI8TaoQ2KIA9b48fT8aTzX/lrywdfHyE/4YL5nl/HS5PDb@MRa8/uP12d//Q7bpa9iiCIHAnYvErZ4MHfj1wX8kugvVcj97iBSv0yB/7z/6TGGdpyIcuxBE8aRnEBUgBzsMTCHj@@lXL@i58F1MXAsdxfPzgt5apKThMVjfFqyaCTrFZxSUL/EDLuC/9SUMf4HAfZVeemidogBFAqTiHm9yQZ@2QoJ2CqcOuboBTzaDuWMsqyEc8JmzvCND4Jbsm0Fq8JhSTCjlLIbSadkhuAj5z4QVzw4VCFJ083GjZar4ImR6pvKHd5b6cuBtwLm2kqpYxpXp70BgoDco0pcqqJFQaWnZ3S86URq9r7Lwyuedc4owCzHRCxnaVv716AFq7gqjYt9DlcVi/vBrshozVoQ0QgB7JYH2Cxv8owtl4g5N4t5/H8z6h3iSUvFwpNw8WoBcvogn0vgGU9uwkAt8tLqKihtPjex5QFYORMGoavGLx0SPxOF9…
@AviFS Re your comment, IIRC there's no deadlineless bounty that awards answers to new challenges, however impressive it is (unless it is written in some specific languages). But you'll be able to nominate it for annual Best Of in a few months, where winners get +500 bounties.
@Bubbler I tried to find it, but couldn't. I thought there was one or two for generally great & unexpected answers. Maybe it was just false hope, though
@Razetime Was it about the "integers in binary" pattern in the constraint thing?
It's kinda hard to explain, but if you start at the lower right side of the antidiagonal line and ignore every other one (and squint very hard at it), you might be able to see the antidiagonals marking ...000, ...001, ...010, ...011, ...100, ...101, etc (the dots marking the bits on a single line are also one dot apart from each other)
Negative numbers are in 2's complement, so -1 is infinite stream of 1 bits, -2 is ...11110, -3 is ...11101, etc
But actually that information is not enough to draw the entire lower-left half plane (because it leaves out how to draw certain lines between those number-representing diagonals)
It might qualify as a special kind of cellular automaton that has three states with two dots black and the rest of the plane gray, and gray cells are gradually converted to black or white based on the constraints, but I'm not sure if the constraints allow a straightforward propagation rule like that
@Bubbler Thanks, I'd totally forgotten. I had 10k in my head, but of course that's only because people don't want to lose privileges... which is probably a good idea.
It's nice being greeted by an actual human, and even if they're pointing out problems being able to ask them for more details or where to look for more info is very good
feature-request status-planned
Yaakov: Please read about our plans to fix this here.
Please do not abandon progress toward the First Posts Steward badge.
Noticing "First answers" and "First questions" were now separate, I checked "First posts":
Slowly but surely, I was working toward the Stewa...
> In a language of your choosing, write the shortest program or function to output an infinite random sequence of \ and / characters, where each character has an equal probability of being chosen.
And before that it even clarifies the character codes of those two characters
Yeah true, but that does sort of indicate that the author intended for text to be used I guess
But drawing diagonal lines on the screen doesn't seem like a valid alternative to outputting text, when the challenge is asking for specific characters