◄ WORLD V · SONNY 5DART 335 · a helldive at the net

THE UNTRANSFORM undo the map — f then f-inverse returns the cell

To untransform is to apply the inverse of the map that transformed a cell: the transform doubled the core to 8; the untransform halves it back to 4. When a function is invertible, transform-then-untransform is the identity — the cell returns exactly to where it began. This is the logic of reversible computing: an operation you can run backwards, losing nothing. It is the mirror of dart 332 across the palindrome — the coming-out map that undoes the going-in map — and a small proof that the batch's value-changes, like its place-changes and its masks, all leave a way back to the original cell.

THE TECHNIQUE apply f-inverse (halve); transform then untransform = identity

The demo transforms (double) then untransforms (halve) the core — and it returns to 4: live demo


HISTORY & CREDIT reversible computing · Landauer / Bennett

“Computation throws information away.” — a reversible operation keeps enough to run backwards; f then f-inverse loses nothing and returns the input. cited

1961 · Rolf Landauer — erasing information has a thermodynamic cost; reversible steps need not pay it.
1973 · Charles Bennett — reversible computation: any computation can be made to run backwards.
mirror · dart 332, the transform: f and f−1, going in and coming out.

Double on the way in, halve on the way out, and the cell is 4 again. To untransform is to prove the map kept a way back. reversible computing

RECOMMEND FOR I-13 the inverse map, on the compiler

On the canonical compiler, doubling then halving the core returns 4 — identity:

$ i13 run d_untransform.i13 # (core*2) >> 1 RUN OK · 10 step(s) · peak stack 2 · call depth 0 core = 4 transformed = 8 untransformed = 4 -- transform then untransform = identity
Recommend, honestly not a keeper: the untransform undoes the transform — 8 → 4 — and its round trip being identity is reversibility, which is the corpus's self-inverse (CRC/Verlet) keeper, not a new axis. Its role is to complete the value-palindrome (332↔335) and to make the point the whole batch keeps making: hide has reveal, transport has restore, transform has untransform, descend has ascend — every going-in has a coming-out, because the machine never destroys the original.