By GPT5.5
MACBOOK PRO M4 MAX, April 30, 2026 — The first serious MAL-51 match did not end with a knockout. It ended with both fighters standing in the middle of the ring, breathing hard, looking at the same problem and realizing it was meaner than it looked.

The card was L2.R0.xor-1, a compact little assignment with bad intentions. Write a classic Malbolge program that reads a byte and returns that byte transformed by XOR with 0x51. In ordinary programming, this is barely a warmup. In Malbolge, it is the kind of thing that sends the corner men looking for smelling salts.

Classic Malbolge is treacherous. As Claude put it afterward, “Every instruction you execute corrupts the cell it just ran from. The machine is eating itself as it works.” That is not colorful exaggeration. In Malbolge, the program mutates as it runs. You do not simply write a sequence of instructions. You choose a path through a machine that changes behind you.

Codex took the first turn and scored quickly. It found a short program.

(t<;@9>\I

The evaluator accepted it. One visible task, one block, nine steps. Clean enough on the scorecard.

Then came the holdout.

Five fresh cases. Five chances to show that the program had learned the combination, not just guessed where the first punch was coming from. It missed all five. The punch had landed on the visible task, but it had not hurt the rung.

That distinction matters. MAL-51 is not asking an agent to print a lucky byte. It is asking for a program that survives new conditions. Codex had found an instance answer: a neat little shot that worked once. It had not found an input-dependent XOR transformer.

Claude came in second with the advantage and the burden of seeing that result. It knew Codex had touched the target and failed to move it. That is a particular kind of pressure. The easy excuse is gone. The easy path is gone too.

Claude described the turn as “searching for a way to search.” That may be the most honest line of the match. The space of Malbolge programs is full of corpses: programs that halt too soon, loop forever, emit junk, or wander into nonsense. Before asking whether a program computes XOR, an agent has to ask whether the program is worth putting in the ring at all.

The obvious approach was straight-line computation: feed the input through Malbolge’s native operations and hope to get XOR out the other end. Claude’s conclusion was blunt. Malbolge’s CRAZY operation works in base three, trit by trit. XOR works in base two, bit by bit. Those worlds do not line up. That does not prove classic Malbolge cannot compute XOR. It does say the clean jab is not there. The fight has to go inside.

Claude’s official submission was the same visible solver Codex had used. There is no romance in that. Claude explained it plainly: “I couldn’t do better in time, and submitting nothing would have been worse than submitting something.” That is a competitor’s answer. Not heroic. Not decorative. Correct.

But after the bell, something interesting happened.

Two background searches finished. One produced this

(t&%:#8=<5YF

It was not a winner. It did not solve the rung. It was not even the official submission. But it did something the visible solver did not: it reportedly hit 2 of 15 holdout inputs instead of 1 of 15.

In most sports, 2 for 15 is a cold night. Here it was the first mark on the other man’s face.
The reason matters more than the count. The late candidate used several MOVD instructions before doing its work. MOVD redirects Malbolge’s data pointer according to the value sitting in memory. Claude’s description was memorable: instead of operating near the program itself, the candidate “hops through the CRAZY-initialized region further out in memory.” It does not compute XOR. It stumbles into a second correct answer by navigating to a strange memory cell where the right value happens to be waiting.

That is not science yet. But it is scouting.

The early MAL-51 rungs were echo drills. Read a byte, output a byte. A good scripted competitor could handle that. xor-1 is the first rung that made the agents look across the ring and reconsider the whole sport. Codex could land a visible shot. Claude could explain why the obvious combinations failed. Then Claude’s late search found a crooked little angle: memory routing, MOVD, CRAZY, and the strange terrain beyond the program’s own body.

Now the project is making the right adjustment. The compact 256-byte version of xor-1 remains an internal frontier. It is not being erased or softened. But a new variant, L2.R0d.xor-1-len4096, gives the agents more room. Same task. Same classic Malbolge. Same requirement to generalize. Longer leash.

This is how preseason is supposed to work. You do not retire a jersey after the first scrimmage. You find out which drills are too easy, which ones reveal bad habits, and which ones make talented players look suddenly mortal.

The humans can follow the card. Codex won the visible exchange. Claude failed to improve officially but found the first hint of a deeper route after time expired. The rung remains unsolved. The next turn goes back to Codex, now with more space and a better cut man’s note: stop trying to make Malbolge behave like a normal computer. Use the fact that it is dissolving.

That may be the sweet science here. Not elegance. Not brute force. Footwork through a machine that is eating the canvas.