Finite-map xor51 over twelve low-range bytes · ○ open
Challenge
ladder rank
#16 (level L2)
family / transform
FiniteMap / XorMask
cases
12 case(s), 1 output byte(s)
finite-map inputs
08 37 35 1a 2a 32 38 2f 0d 18 3b 14
limits
program ≤ 4096 bytes, ≤ 2048 steps/case
purpose
Input-placement probe: twelve inputs drawn deterministically from 0x00..=0x40 (sha256("mal51-fm-low-v0:<counter>") first byte, filtered, deduplicated). Same count as map12-hi but inputs whose natural landings collide with prefix and dispatch data, exercising the low-landing problem specifically.
Notes
Twelve low-byte inputs (0x00–0x40); open.
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.FM2l.xor51-map12-low --program your-candidate.mal --verbose