Streaming fixed-memory merkle tree with backend-agnostic storage.

neodata implements a B-ary merkle tree (default B=16) that supports O(log_B N) incremental append using positional grouping. The tree's internal nodes are stored in a pluggable [Store] backend, keeping only the root hashes and entry count in memory.

Quick start

use neodata::{MerkleLog, MemStore};

let mut log = MerkleLog::<MemStore, 16>::new(MemStore::new());
let hash = log.append(b"hello").unwrap();
assert_eq!(log.length(), 1);