The Fold Is A Magma
Theorem.The Fold Is A Magma — The fold is a magma: merge(a,b) = toUuid(a‖b) is a total binary operation on content-addresses that is closed (always an address), non-commutative (order-sensitive), non-associative (grouping-sensitive), has no identity element, and is one-way (no inverses)..
Proof.The fold is a magma: merge(a,b) = toUuid(a‖b) is a total binary operation on content-addresses that is closed (always an address), non-commutative (order-sensitive), non-associative (grouping-sensitive), has no identity element, and is one-way (no inverses). It is exactly a magma — weaker than a monoid or group — which is what a content-addressed, tamper-evident fold must be: reversibility would break the seal.
Checked by exact arithmetic over the stated finite range — a verified witness, evidence toward the claim, not a ∀-proof.
src/0 foldMagmaLaws/index.ts#foldMagmaLaws
1 · Classification
bounded-witness — morph from sealed card/discovery fold
2 · Provenance
cardScientificPaperRows ← src/0 foldMagmaLaws
Acknowledgment
"The Fold Is A Magma" 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 foldMagmaLaws.
- 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 (foldMagmaLaws @ src/0 foldMagmaLaws) that re-derives the result at zero tokens — the contribution is the verifiable recomputation, NOT the theorem
3 · Reproducibility
recompute foldMagmaLaws · npm run quantum:card-paper-links · paperRoute=/theorems/fold-magma-laws