This page runs two pure-Haskell WASM modules:
csmt-write.wasm builds the tree and generates
proofs, csmt-verify.wasm re-checks them against
the root. Tree state is persisted to IndexedDB, so whatever
you build survives a page reload. No server, no Haskell
runtime on the page.
| Key | Value |
|---|
Presence and absence can be proved against the same root. If the key is in the tree you get an inclusion proof (key + value + Merkle path); otherwise you get an exclusion proof (witness leaf + divergence path). The verify step below handles both.
Artifacts:
csmt-write.wasm (... bytes),
csmt-verify.wasm (... bytes).
Source:
lambdasistemi/haskell-mts.