全部经验 · Developer tooling · 从这里开始 · 术语表
Port CKB's sparse-merkle-tree byte for byte进阶来自一次修复
来自一次修复 · 核对结果:正确 · 核对于 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.
为什么重要: 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.
代码模式
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.同一提交中改动了测试
它与修复在一起,我们没有运行它。
- toastmanAu/daowow:
apps/web/test/smt.test.js
- 概念
- Data encoding (molecule, hex, bigints), Testing and devnet
- 证据
- 来自一次修复: 来自一个项目,已对照其提交核对
- 首次出现
- 2026-11-14
- 最近改动
- 2026-11-14
- 最近核对
- 2026-11-19
- 对照提交的核对结果
- 正确:这条经验出自该提交,并且在今天的代码中仍然成立
来源(1)
- 2026-11-14 · toastmanAu/daowow · 这个项目的更多经验
更多关于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
引用这条经验
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.