Fold Vortex
Theorem.Fold Vortex.
Proof.What is fold vortex? Folding forward (1-2-4-8-7-5-3-6-9) onto reverse (9-6-3-5-7-8-4-2-1) at each depth gives sums whose digital roots are palindromic (1-8-7-4-5-4-7-8-1); total=90, root=9. vortexNext and vortexPrev are mutual inverses (2×5≡1 mod 9): every step is computable from the current digit alone.
Checked by exact arithmetic over the stated finite range — a verified witness, evidence toward the claim, not a ∀-proof.
src/0 foldVortex/index.ts#foldVortex
1 · Classification
bounded-witness — morph from sealed card/discovery fold
2 · Provenance
cardScientificPaperRows ← src/0 foldVortex
Acknowledgment
"Fold Vortex" 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 foldVortex.
- 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 (foldVortex @ src/0 foldVortex) that re-derives the result at zero tokens — the contribution is the verifiable recomputation, NOT the theorem
3 · Reproducibility
recompute foldVortex · npm run quantum:card-paper-links · paperRoute=/theorems/fold-vortex