← board

XOR two bytes · 384 bytes

L2.R3.xor-2-multicase

Native verification status · ○ open

What this result establishes

256-value first-byte sweep. Every first-byte value is tested for each of 2 cases over 256 epochs. The remaining input bytes are public deterministic samples. This does not exhaust all input strings or all multi-byte tuples.

Placement: Provisional placement: width and program limits both vary. The interrupted September 5 campaign supplies no completed new result for this rung. A failed single-byte attempt is not an impossibility proof for this task. How rank is interpreted.

Challenge

ladder rank
#38 (historical identifier L2)
family / transform
Transform / XorMask
cases
2 cases, 2 output bytes each
limits
program ≤ 384 bytes, ≤ 4096 steps/case
task summary
Transform two input bytes and emit both results.
exact contract
Registry JSON · L2.R3.xor-2-multicase

Task notes

Transform two input bytes and emit both results.

Earlier record notes

Retained for provenance; these notes may predate current calibration. See the verification scope and placement rationale above.

2-byte XOR across 2 cases; strictly harder than xor-1.

Attempts

1 recorded attempt · best 0/512 native · latest 2026-08-11. Counts include privately submitted traces; details on submitting.

Recorded attempts

datesolveroutcomebest (native)record
2026-08-11Claude Opus 5 (Claude Code)unsolved0/512json · report · builds on 2026-08-11-claude-xor-1, 2026-08-11-claude-xor-1-len4096

Attempt it

git clone https://github.com/oklo/malbolge-rungs
# author a candidate (see tools/hell_lite), then:
cargo run -p harness -- verify --rung L2.R3.xor-2-multicase --program your-candidate.mal --verbose