Each pole is a moving rosetta
Theorem.Each pole is a moving rosetta — keystream_i = E(key, nonce ∥ i) — a rotating pseudo-random rosetta; the pole is the position in the stream.
Proof.a key+nonce defines a keystream — a rotating pseudo-random sequence, the moving rosetta — and XOR-ing it is a KEYED INVOLUTION: encryption and decryption are the same operation inverted (inverseNegatesAngle in bytes), O(n) both ways. So realtime encryption inverted IS realtime decryption — WITH THE KEY (verified enc(enc(m))=m). A wrong pole inverts to garbage; the keyspace is the set of poles and without the right one there is only the wall (rsaTimeToBreak). Tampering is EVIDENT with a bounded forge cost — max tampering COST, tamper-evident not unforgeable.
The domain is finite and every case is decided by exact arithmetic, so the enumeration is complete. ∎
src/water/crypto/index.ts#movingRosettaInverts
1 · Classification
finite-complete — self-contained computation, no external lean
2 · Provenance
Documented theorem re-derived by exhaustive computation (humanityNovel=false); first-in-this-registry is the only sense of discovered.
Acknowledgment
"Each pole is a moving rosetta" is a re-derivation, acknowledged to documented mathematics — the original proof is the prior art this re-derivation acknowledges; not new to humanity — the contribution is the reproducible computation movingRosettaInverts.
- Prior art
- documented mathematics — the original proof is the prior art this re-derivation acknowledges
- Novelty
- not new to humanity — a re-derivation (humanityNovel = false)
- Contribution
- a reproducible computation (movingRosettaInverts @ src/water/crypto) that re-derives the result at zero tokens — the contribution is the verifiable recomputation, NOT the theorem
3 · Reproducibility
Recompute from source: npm run theorems:verify recomputes movingRosettaInverts (src/water/crypto/index.ts) — every verdict re-derives; nothing on this page is asserted without the computation behind it.