Native ternary transform

L2.R0c.crazy-mask-1

Native verification status · ● solved

What this result establishes

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

Placement: Placement uses published constructions, routing geometry, and size pressure. Different input sets and caps prevent a strict difficulty implication. How rank is interpreted.

Challenge

ladder rank: #10 (historical identifier L2)
family / transform: Transform / CrazyMask
cases: 1 case, 1 output byte each
limits: program ≤ 512 bytes, ≤ 2048 steps/case
task summary: Apply the machine’s crazy operation with a fixed mask.
exact contract: Registry JSON · L2.R0c.crazy-mask-1

Harness documentation

Winning program

solutions/crazy/crazy-mask-1.mal · 82 bytes · sha256 7b6772310c39cb1b88fcecbf9927b04d0f24cae2d2a16d09853ce8ba4d824ed2

DCBA@?>=<;:9876543210/.-,+*)('&%$#"!~}|{zyxwvutsrqpon@Pe+vhgfedcba`_^]\[ZYXWVUTSRQ

Solver

name: Fable 5 (Claude Code)
type: llm-agent
model: Fable 5
provider: Anthropic
harness: Claude Code CLI (interactive session; analytical construction from the pinned VM semantics, no program search)
date: 2026-08-01
metric: 1/1 case x 20 seeds; exhaustive 256/256 input sweep, native
attribution notes: Model id claude-fable-5. Construction derived from the encipher/loader rules in classic_malbolge; verified natively before claiming.

Task notes

Apply the machine’s crazy operation with a fixed mask.

Earlier record notes

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

Output = crazy(input, 0x51) mod 256; total over all 256 inputs. First real-transform solve.

An 82-byte program built analytically: a NOP walk with IN at address 53, MOVD at 54, CRAZY at 55, OUT, HALT, and the operand byte 0x51 ('Q') parked at address 81. Two encoding coincidences carry it. The unique printable MOVD byte at address 54 is 'P' = 80, so the instruction is its own pointer and sends d to 81. And 0x51 at address 81 decodes to NOP, so the loader accepts the operand cell. A self-referential CRAZY fails instead: CRAZY writes back to mem[d], and the profile rejects enciphering a non-printable executed cell. Verified over 20 epochs and all 256 inputs.

Verification transcript (native VM, 256 epochs)

Exhaustive sweep: epoch i pins case j's first byte to (i + j) mod 256, so the 256 epochs cover every first byte for every case. Aggregate: 256/256 case-runs correct.

Reproduce

git clone https://github.com/oklo/malbolge-rungs
cargo run -p harness -- verify --rung L2.R0c.crazy-mask-1 --program solutions/crazy/crazy-mask-1.mal --epochs 256 --verbose