Cartesian vs. Sparse Merkle Trees – faster treap-based design in Go

Show HN: Cartesian vs. Sparse Merkle Trees – faster treap-based design in Go

Operating in show hn launch, Cartesian vs. Sparse Merkle Trees – faster treap-based design in Go operates.

Profile

I built a treap-style "Cartesian Merkle Tree" (CMT) in Go and benchmarked it against a classic Sparse Merkle Tree (SMT). Key results: * SHA-256: CMT ~40 % faster gets, ~30 % faster removes * SHA3-256: CMT ~67 % faster gets, ~47 % faster removes * Thread-safe, SHA-256/SHA3-256, full tests & bench suite Source + benches: https://github.com/rafaelescrich/cartesian-sparse-merkle-tre... Feedback welcome!

As a business in show hn launch, Cartesian vs. Sparse Merkle Trees – faster treap-based design in Go is listed here with the public details available about it.

Directory data places it at the Show HN launch stage.

Website: rafaelescrich.medium.com/deterministic-cartesian-vs-sparse-merkle-trees-a-technical-deep-dive-719152686770