All lessons · Developer tooling · Start here · Glossary
Port CKB's sparse-merkle-tree byte for byteAdvancedFrom one fix
From one fix · Check: right · Checked 2026-11-19
nervosnetwork/sparse-merkle-tree folds runs of empty siblings into MergeWithZero nodes (merge byte 2; a normal merge uses byte 1 plus height and parent path), and bit 0 of a key is the low bit of byte 0. Compiled proofs use the opcodes 0x4c, 0x50, 0x51, 0x4f n (n=0 means 256) and 0x48. Test any off-chain port against vectors generated by the Rust code.
Why it matters: A port that follows a textbook sparse Merkle tree, or gets the bit order or merge prefixes wrong, produces roots and proofs that the on-chain Rust verifier rejects.
Pattern
Port smt merge/compile/compute_root byte for byte (MERGE_NORMAL=1, MERGE_ZEROS=2, parent_path clears bits 0..=height) and test it against Rust-generated root and proof vectors.A test changed in the same commit
It sits next to the fix. We did not run it.
- toastmanAu/daowow:
apps/web/test/smt.test.js
- Concepts
- Data encoding (molecule, hex, bigints), Testing and devnet
- Evidence
- From one fix: from one project, checked against its commit
- First seen
- 2026-11-14
- Last changed
- 2026-11-14
- Last checked
- 2026-11-19
- Check against the commit
- right: the lesson follows from its commit and still holds in the code today
Sources (1)
- 2026-11-14 · toastmanAu/daowow · more from this project
More about Developer tooling
- ckb-vm-js 0.2.0 (npm) checks header hash instead of rejecting the field
- Emit shannon u64 values as strings in cross-language test vectors
- Mirror on-chain rules off-chain with mutation tests
Do you maintain a project this lesson came from? Confirm or correct it
Cite this lesson
LusoCryptoLabs, "Port CKB's sparse-merkle-tree byte for byte", CKB lessons, https://pulse.lusocryptolabs.com/learned/tooling/port-ckb-s-sparse-merkle-tree-byte-for-byte, CC BY 4.0, last changed 2026-11-14.