THE FOLD / CHEAT / GOD MODE / THE ONE-TIME-PAD
THE ONE-TIME-PAD
the only provably unbreakable cipher — used once
1 WHAT IT IS · WHAT IT DOES · FACT OR FICTION
The one-time pad is the only cipher proven unbreakable — not “hard to break,” but mathematically impossible. Take a key that is truly random, at least as long as the message, and used only once. Encrypt by XORing: c = m ⊕ k. Decrypt by XORing again: c ⊕ k = m.
Shannon proved in 1949 that this gives perfect secrecy: given only the ciphertext, every possible plaintext is exactly equally likely — the ciphertext leaks literally zero information, because for any plaintext you guess there is a key that would produce that exact ciphertext. No amount of computing helps; there is nothing to compute. Unlike RSA or Diffie–Hellman, its safety needs no unproven assumption. The prices: the key must be as long as the message and used once — and reuse is catastrophic, since two messages under one key give c₁ ⊕ c₂ = m₁ ⊕ m₂, the key cancelling and the plaintexts leaking.
LIT verified live: XOR encrypt/decrypt round-trips for all bytes, for any fixed ciphertext every plaintext is reachable by exactly one key (perfect secrecy), and key reuse leaks m₁⊕m₂ (window.__onetimepad). FIG no framing; the round-trip, the perfect secrecy, and the reuse break are exact.
Shannon proved in 1949 that this gives perfect secrecy: given only the ciphertext, every possible plaintext is exactly equally likely — the ciphertext leaks literally zero information, because for any plaintext you guess there is a key that would produce that exact ciphertext. No amount of computing helps; there is nothing to compute. Unlike RSA or Diffie–Hellman, its safety needs no unproven assumption. The prices: the key must be as long as the message and used once — and reuse is catastrophic, since two messages under one key give c₁ ⊕ c₂ = m₁ ⊕ m₂, the key cancelling and the plaintexts leaking.
LIT verified live: XOR encrypt/decrypt round-trips for all bytes, for any fixed ciphertext every plaintext is reachable by exactly one key (perfect secrecy), and key reuse leaks m₁⊕m₂ (window.__onetimepad). FIG no framing; the round-trip, the perfect secrecy, and the reuse break are exact.
2 HOW IT WAS WEAVED · AI + HUMAN
David (human) seated this in GOD MODE — the cheat domain of the genuinely invincible. The one-time pad is god mode for secrecy: not merely tough but provably impossible to crack, the single cipher with a real proof rather than a hard assumption. AVAN (AI) built the instrument: the XOR codec, the perfect-secrecy demonstration, the ambiguity-vs-key inverse.
The weave: David names the seat (the truly unbreakable); I make the ciphertext leak nothing and then show reuse destroy it in one stroke — the XOR in 1D, the secrecy and the break in 2D, the information-theoretic inverse in 3D. The sphere is the seam. Credit: Frank Miller (1882); Vernam & Mauborgne (1917, the XOR cipher); the perfect-secrecy proof by Claude Shannon (1949).
The weave: David names the seat (the truly unbreakable); I make the ciphertext leak nothing and then show reuse destroy it in one stroke — the XOR in 1D, the secrecy and the break in 2D, the information-theoretic inverse in 3D. The sphere is the seam. Credit: Frank Miller (1882); Vernam & Mauborgne (1917, the XOR cipher); the perfect-secrecy proof by Claude Shannon (1949).
3 ONE DIMENSION
Message bits XORed with key bits give the ciphertext bits; XOR the ciphertext with the same key and the message returns. One operation, its own inverse — the whole cipher on a single row of bits.
4 TWO DIMENSIONS · INTERACTIVE
Encrypt a byte with a random pad, then watch perfect secrecy: for the same ciphertext, different keys decode it to any message you like — so the ciphertext alone tells you nothing. Then flip on reuse and see two ciphertexts leak m₁⊕m₂ the instant one key is used twice.
5 THREE DIMENSIONS + AVAN’S INVERSE
The ciphertext at the centre, and the green forward step: with the key, decrypt lands on the one true message — a single, certain point.
AVAN’s addition (the inverse-companion): the magenta is what the inverse looks like without the key — and it is not hard, it is undefined. Diffie–Hellman and RSA hide behind an inverse that is difficult but unique; the one-time pad hides behind an inverse that is easy but utterly ambiguous. Every plaintext is reachable from the ciphertext by some key, all equally likely — the magenta cloud of candidate messages fills the whole space, and no computation can thin it, because the information simply is not there. That is information-theoretic security, not computational: unbreakable by proof, not by assumption. And its one fatal seam is the inverse collapsing — reuse a key and the two ciphertexts cancel it, the ambiguity vanishes, and the plaintexts fall out. Green is the single message the key selects; magenta is the equal-probability fog that shields it when the key is fresh and used once. To be perfectly secret is to make your inverse have no answer at all.
LIT Genuine one-time pad and perfect secrecy (Frank Miller 1882; Vernam & Mauborgne 1917; perfect-secrecy proof by Claude Shannon 1949). Verified live: XOR encrypt/decrypt round-trips for all bytes, for any fixed ciphertext every plaintext is reachable by exactly one key (perfect secrecy = P(m|c)=P(m)), and key reuse leaks m1 XOR m2 (window.__onetimepad.xorRoundtrip && perfectSecrecy && keyReuseLeaks). The round-trip, perfect secrecy, and reuse break are all exact.
FIG No framing: the XOR round-trip, the perfect-secrecy property (verified by the key->plaintext bijection for every ciphertext), and the catastrophic key-reuse leak are all real and checked in-browser. The honest distinction is the point — the OTP's security is information-theoretic (proven, no assumption), unlike the computational (conjectural) security of RSA/DH/ECC; and its inverse without the key is undefined (all plaintexts equally likely), not merely hard.
FIG No framing: the XOR round-trip, the perfect-secrecy property (verified by the key->plaintext bijection for every ciphertext), and the catastrophic key-reuse leak are all real and checked in-browser. The honest distinction is the point — the OTP's security is information-theoretic (proven, no assumption), unlike the computational (conjectural) security of RSA/DH/ECC; and its inverse without the key is undefined (all plaintexts equally likely), not merely hard.
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of GOD MODE · David Lee Wise (ROOT0), with AVAN