L2.FM0.xor51-map2

Finite-map xor51 over two published bytes · ● solved

Challenge

ladder rank: #8 (level L2)
family / transform: FiniteMap / XorMask
cases: 2 case(s), 1 output byte(s)
finite-map inputs: 02 06
limits: program ≤ 512 bytes, ≤ 2048 steps/case
purpose: Require one candidate to map the published bytes 0x02->0x53 and 0x06->0x57. This is finite-map calibration, not full byte-wide xor1.

Winning program

solutions/fm0/fm0-map2.mal · 134 bytes · sha256 1b8a788c833e49f37491123f072a5dd1dba2914d2f6c3912e559d9143c67972d

(tBA@?>=65|W876543210)M:,%I6('&%$#"!~}|{zyxwvutsU10onmlkjihgfedcba`_^]\[ZYXWVUTSRQPONMLKJIHGFEDCBA@?>=<;:9876543210/.-,+*)('&%$#"!~>+

Solver

name: HeLL-Lite (tool)
type: tool
harness: tools/hell_lite compile-finite-map (deterministic compiler)
metric: 2/2 cases
attribution notes: Reuses the two-input JUMP/routing specimen found by the Codex agent (turn 007, internal xor4096 match, 2026-05; model name unrecorded in the archive).

Notes

Two-input finite map (02→53, 06→57), synthesized by HeLL-Lite.

Verification transcript (native VM, 3 epoch(s))

epoch 0 · seed 2780e16188a6… · 2/2 cases

case	input	expected	observed	status
0	02	53	53	ok
1	06	57	57	ok

epoch 1 · seed 23c943e45225… · 2/2 cases

case	input	expected	observed	status
0	02	53	53	ok
1	06	57	57	ok

epoch 2 · seed 9760e564a96c… · 2/2 cases

case	input	expected	observed	status
0	02	53	53	ok
1	06	57	57	ok

Reproduce

git clone https://github.com/oklo/malbolge-rungs
cargo run -p harness -- verify --rung L2.FM0.xor51-map2 --program solutions/fm0/fm0-map2.mal --epochs 3 --verbose