The Nineteenth Byte

okay so full disclosure: I will not be adding carets to Rabbit

user

Thank you

You could always add carrots instead

Q: What's the Missing Code? (Cops)

...yet!

I'm probably going to make it an extra, optional module that h4xors the interpreter to add it in

but that's a later thing

Newly Featured Posts

23

Q: Quicksand (piles)

In this fastest-code challenge, you take a positive integer as input, which represents the height of a sand pile, located at (0,0) on an infinite square grid. For example, if our input is 123, the sand grid looks initially like this: \$\begin{matrix} \ddots & \vdots & \vdots & \vdots & \cdot^{\cd...

27

Cops' Challenge Robbers' challenge here. It has now been four days since the challenge was posted so all new answers should be marked as non-competing in the title. These answers can still be cracked by robbers but will not go towards their total, and cannot win this challenge. In this cops-and...

string code-challenge kolmogorov-complexity source-layout cops-and-robbers

11

Q: What's the Missing Code? (Robbers)

Robbers' Challenge Read the cops' challenge first. In this cops-and-robbers challenge, you (the robbers) must find the correct string of characters, which, when added into the cop's code, will make it produce the correct (case-sensitive) output (except that there may also be an extra trailing new...

string cops-and-robbers

but what will xor be?? or power?? or whatever carets are usually used for??

12:16 AM

we don't need xor where we're going

oh damn best of bounties are all coming in

I made xor the letter 'x' in Trilangle because the caret was already a branch instruction

@Ginger and where would that be??

ur mom's house

O_O

12:17 AM

she's just around the corner, right next to taco cabeza

Boolean XOR and XNOR are just != and ==

easily within walking distance

you only really need bitwise XOR

@Ginger ok i feel like thats a reference to smth but idk what

ask @lyxal :p

12:18 AM

You'd do better than to talk to me

Because I just give horrible prac-lang ideas

not asking about praclang ideas but ok

well ok u just piqued my interest, what kinda horrifying prac-lang ideas ya got hiding

scroll up

@AidenChow don't say I didn't warn you

-> stdin
<- add //export the add lambda in main
main:
  Lambda<Int, Int, #Int> add := * + *
  stdin/println("Enter a number")
  |- (error?) Int a = stdin/input
  |stdin/println("Enter another number")
  ||-(error?) Int b = stdin/input
  ||(halt) stdin/println("Result is "$add(a, b))
  |+> (halt) stdin/println("Something went wrong handling input a")
   -> (halt) stdin/println("Something went wrong handling input b")

Who needs try/catch when you can point to where you want to go?

good god

@RydwolfPrograms come here at once

oh jeez

what a concept

12:27 AM

as I said

don't say I didn't warn you

the worst part is that these are fun to make

it's like an art form

creating something that once you get past the glaring thing keeps getting subtly worse

something that disgusts people on all sorts of levels

I'm implementing this in Rabbit

which part?

yes

(I mean, I'm going to write an interpreter for it in Rabbit)

(once it's done ofc)

the Lambda assignment, arrows to import/export, slashes for methods/attributes, $ for string concatenation that auto-casts to int, or ascii art error handling?

oh all of it

the whole thing is godawful

I love it so much

this is better than Vyxal

12:49 AM

new class Animal: <-------------+- new class Dog:
  - String noise                |  - String name
  + () -> # speak =             |  + (String) -> # !Create =
    stdlib.println(my.noise)    |    my.noise = "Bark"
  + (String) -> # !Create =     |    my.name = *1
    noise = *1                  |  + () -> # !Destroy =
                                |      del name
                                |      del noise
                                |      stdlib.println("Goodbye human")
                                |

I've thrown a little UML in there :p

There is a nuke approaching your location

what's UML?

Unified Modeling Language

Unified Modelling Language

you learn about it once you start doing the engineering side of software

The Unified Modeling Language (UML) is a general-purpose, developmental modeling language in the field of software engineering that is intended to provide a standard way to visualize the design of a system.The creation of UML was originally motivated by the desire to standardize the disparate notational systems and approaches to software design. It was developed at Rational Software in 1994–1995, with further development led by them through 1996.In 1997, UML was adopted as a standard by the Object Management Group (OMG), and has been managed by this organization ever since. In 2005, UML was also...

OldSandboxPosts

Sandbox posts last active a week ago: Enumeration of free polyominoes

sus

→ 1 message moved to Trash

1:00 AM

now try the 2 after it

→ 2 messages moved to Trash

weird

ty

1:18 AM

ok... time to redo all my tradoop code into structrait code

FINALLY

~~I can resume stealing your code!~~

~~or you can steal mine, because my structrait implementation is about 70% functional~~

~~i will do it without poisoning myself with your code~~

~~my code is fine, stop whining~~

A: Sandbox for Proposed Challenges

2:30 AM

@lyxal I pinged you once before about George, but I want to ask: were you involved in Wiki Encyclopedia at all?

Sandbox Posts

3:04 AM

0

The Coach's Challenge code-challenge Problem author: https://stats.ioinformatics.org/people/5309 Fair warning: This challenge is not code golf. I will not accept I/O rule extensions. I/O must occur over standard streams, no exceptions. A coach poses this challenge: Given an integer array of lengt...

@Bbrk24 no

Ah, okay

I don't even know what wiki encyclopaedia is :p

It was a project that some other members of George worked on years ago that I stumbled upon in 2021. It's dead now, sadly (I heard the drive was physically stolen)

Have you heard of the apioforum and the apionet?

3:10 AM

only from the pseudoads on george

Yeah they're places you find similar circles of people :p

3:44 AM

@Ginger I am arrive

Okay I read some transcript and lyxal why do you hate us

That code sample looks like a SNOBOL dev, a Perl enthusiast, and someone who had spent eleven years writing purely shell script got together in an isolated chamber to design a language, but got in a massive fight, designed three separate languages, and relied on git merge to unify them into a cohesive praclang

@RydwolfPrograms I did it for me. I liked it. I was good at it. I felt... alive.

> I was good at it

[citation needed]

Neil

6:24 AM

  await new Promise(
    (resolve: () => void, reject: (reason: Error) => void) => {
      try {
        return chrome.tabs.executeScript(
          { file: "/dist/content.js" },
          () => {
            chrome.tabs.insertCSS({ file: "/css/content.css" }, resolve);
          }
        );
      } catch (error) {
        console.error(error);
        return reject(error);
      }
    }
  );

in Firefox you just write

await browser.tabs.executeScript({ file: "dist/content.js" }); await browser.tabs.insertCSS({ file: "/css/content.css" });

7:55 AM

@Bbrk24 you've clearly never broken bad

Q: On The Subject Of Simon Says

8:25 AM

Ok so I'm looking for a agorithm that can generate all numbers upto 2^32 in random order based on a seed, and is cryptographically secure

Hello, World!

0

A: "Hello, World!"

Python 3, 20 bytes print("Hello, World!")

New Posts

9:48 AM

0

This challenge is from a game, Keep Talking And Nobody Explodes. This is like one of those toys you played with as a kid where you have to match the pattern that appears, except this one is a knockoff that was probably purchased at a dollar store. – From the manual Objective The Simon Says module...

code-golf string decision-problem game

3:00 PM

@mousetail If seeding weren't a requirement, I'd just say "read four bytes from /dev/random." I'm not aware of any algorithm that's typically advertised as cryptographically secure and seedable -- cryptographically secure randomness typically originates in hardware, from what I've seen.

Huỳnh Trần Khanh

libsodium literally has a seedable CSPRNG

those CSPRNGs are also commonly called KDFs

A: Sandbox for Proposed Challenges

3:18 PM

@Bbrk24 It's more encryption than randomness I'm after

New Posts

4:38 PM

0

Q: Qat Equation Solver

Qat is a tool that lets you search for words matching a given pattern, often used by crossword and other word puzzle writers and solvers. In this challenge, you will have to implement a specific part of Qat, namely a subset of the "equation solver". Equations The output of a Qat query depends on ...

code-golf

Sandbox Posts

5:04 PM

0

https://www.youtube.com/watch?v=3DdUvoc7tJ4 Play RPS 25 RPS 25 is a version of Rock Paper Scissors which has 25 hand symbols instead of just 3. Here's a chart showing which symbols defeat which: The challenge here is simple: your program should take in two strings representing the symbols thrown...

5:34 PM

@Bbrk24 They're not looking for a single random number

> all numbers upto 2^32 in random order

The way I'd probably do it is:

1. Generate a random 32 bit number (this is the first in the list)
2. Generate a second random 32 bit number, discarding it if it's 2**32-1. Once you find one, add the Nth unchosen number to the list (so if it's less than the first number append it, otherwise increment it then append it)
3. Do that again, discarding it if it's greater than or equal to 2**32-2
4. Repeat until you get to 2**31
5. Choose a random 31-bit number (probably a 32-bit one with one bit discarded)
6. Do the above process for a while

Even though this takes different amounts of time to run since you discard some random numbers, that doesn't communicate any information about the final permutation

Actually wait I've got a much better idea

Feed every number from 0 to 2**32 into AES, with the key being derived from the seed

Then sort the inputs by the outputs of AES

If you could find a secure block cipher with a 32-bit block size, you wouldn't even need the last step

Turning a number into its index in the permutation would just be encrypting it

A stream cipher might work too?

Which would give you more flexibility

@mousetail ^

It's worth noting a block cipher is basically exactly what you're describing: A permutation based on a seed that's cryptographically secure

(and so also be aware of the risks of using that permutation too directly)

5:52 PM

@RydwolfPrograms This would require storing 2 GB of data though for every increment

Well unless you procedurally generate the permutation you'd have to store 2 GB of data anyway, so you probably have the space for 2 more

But yeah that naïve approach is not a good option

Procedurally generating the permutation is the idea yes

I just completely forgot encryption algos exist

For reference, this is going used to generate a primary key in a database in such a way that ids exist should be unpredicable