$ cat writeup.md…
$ cat writeup.md…
UIUCTF 2026
Task: stripped x86-64 PIE recovery console verifies a 48-hex token through a SIGILL/ud2-driven VM across three chained segments. Solution: emulate the illegal-instruction VM in Unicorn, prove the per-round cmp is a self-referential decoy and the real gate is an all-zero output-accumulator OR, reduce each segment to an arity-3 CSP, and solve by backtracking.
$ cat /etc/rate-limit
Rate limit reached (20 reads/hour per IP). Showing preview only — full content returns at the next hour roll-over.
A recovery console has one token cached somewhere inside it. The verifier looks ordinary until the illegal instructions start firing.
A stripped x86-64 Linux PIE binary prompts token> and accepts a flag of the form uiuctf{<48 lowercase hex chars>}, printing accepted or rejected. Goal: recover the 48-hex token body.
SIGILL/ud2; the real control flow lives inside a signal handler, not in ordinary linear code.vector-cache recovery console, reads the line with fgets (0x10e3), strips newline via strcspn (0x10fc), strlen (0x110d).uiuctf{, a } at index 55, total length 0x38, then hex-decodes the 48 hex chars into 24 raw bytes (0x111d..0x123b).SIGILL handler (sigaction) — handler pointer loaded at 0x106e (handler @ 0x2080), armed at 0x1091.The 24 bytes are verified through THREE chained "segments", each an illegal-instruction VM. Input mapping: seg0 → bytes[0:8], seg1 → [8:16], seg2 → [16:24].
The verifier FUNC @ 0x2620 is called as FUNC(rdi=out_buf, rsi=seg_idx, rdx=input_ptr, rcx=chaining_seed). It:
rcx,state+0x18,.bss global @ 0xa030,ud2 @ 0x2980 in a loop.Each ud2 faults into the SIGILL handler @ 0x2080, which runs ONE VM round and advances the faulting RIP by +2 via ucontext (mcontext gregs REG_RIP at ucontext+0xa8).
...
$ grep --similar