toUuid(seed): 128-bit id from four 32-bit hashes≈SHA-256 / BLAKE3 cryptographic hashSame idea (content -> fixed-size id); the site hash is fast and deterministic but not collision/preimage resistant.
Crypto Compare — shown in full detail, with its proof: a deterministic content-address recomputable from the component's name.
cryptography · comparison
toUuid(seed): 128-bit id from four 32-bit hashes≈SHA-256 / BLAKE3 cryptographic hashSame idea (content -> fixed-size id); the site hash is fast and deterministic but not collision/preimage resistant.
merge(a,b) = toUuid("a:b"), order-sensitive≈Merkle node H(left ‖ right)Order-sensitivity matches a real Merkle node; security still depends on the underlying hash, which here is non-cryptographic.
merkleFold(leaves): tree of merges≈Merkle tree (RFC 6962, Certificate Transparency)Identical structure and inclusion-proof idea; the site proves structure and recomputability, not cryptographic soundness.
foldBlockchain: hash-linked blocks≈Hash chain / blockchain (PoW or BFT consensus)Tamper-evident links, but no consensus, no proof-of-work, single-writer — a ledger shape, not a distributed ledger.
content-addressed UUID stream≈Git (SHA-1 -> SHA-256), IPFS multihashSame content-addressing principle as Git/IPFS; those use vetted hashes, the site uses a fast non-crypto one.
build-time model seal + git-history fold≈Reproducible builds, code signing, SigstoreReproducibility and tamper-evidence are real; there is no signing key or trusted authority, so it is evidence, not attestation.
Honest: the fold here shares the SHAPES of cryptography (content-addressing, Merkle trees, hash chains) but uses a 128-bit NON-cryptographic hash. It gives deterministic addressing and tamper-evidence — not collision resistance. For adversarial security use SHA-256/BLAKE3.
✓ proven · content-address 22553704-897f-8a4f-b7ef-0075578e1475 — declared, placed, mounted, and recomputable from the component's name.