dig-smt 0.1.1

DIG Network generic sparse-merkle-tree mechanism: a sha256 SMT over 32-byte keys with membership + non-membership proofs, extracted verbatim from dig-identity (byte-identical roots). Wraps the audited Nervos sparse-merkle-tree crate; carries no DIG-domain knowledge.
Documentation

dig-smt

The DIG Network generic sparse-merkle-tree mechanism: a sha256 SMT over 32-byte keys with real membership and non-membership proofs. Extracted verbatim (byte-identical roots) from dig-identity's profile tree so the mechanism can be reused without pulling in any DIG-domain code.

dig-smt is the generic MECHANISM only — it knows nothing about DIG slots, values, profiles, or DIDs. A caller supplies raw 32-byte keys and opaque value bytes; a higher-level crate builds a domain schema (slot-key derivation, value encoding) on top and consumes this tree.

It wraps the audited Nervos sparse-merkle-tree crate — the merkle construction is never re-implemented; dig-smt supplies only the sha256 node hasher and the leaf-hash scheme.

Byte-contract

For a given set of (key, value) leaves, the 32-byte root is byte-identical to dig-identity's current profile root. A DIG profile root is on-chain-anchored, so this is a frozen §5.1 / NC-9 contract, pinned by a golden root vector (tests/golden_root.rs). See SPEC.md for the normative hashing and proof contract.

Usage

use dig_smt::{SmtTree, verify_membership, verify_non_membership};

let mut tree = SmtTree::new();
let name_key = [1u8; 32];
tree.set(name_key, b"Ada".to_vec()).unwrap();
let root = tree.root();

// Prove the key holds "Ada" using only (root, key, value, proof).
let membership = tree.prove_membership(name_key).unwrap();
assert!(verify_membership(&root, name_key, b"Ada", &membership).unwrap());

// Prove a different key is absent.
let absent_key = [2u8; 32];
let absent = tree.prove_non_membership(absent_key).unwrap();
assert!(verify_non_membership(&root, absent_key, &absent).unwrap());

Install

[dependencies]
dig-smt = "0.1"

License

GPL-2.0-only.