Explore compact `Subtree` storage for `LargeSmt` (store subset of nodes)
未关闭
merkle
- 主要语言
- Rust
- 星标
- 772
- 派生
- 352
- 平均合并
- 1 天 7 小时
- 30 天内合并 PR
- 84
描述
Currently, `LargeSmt`'s `Subtree` stores all internal nodes (up to 255 nodes per 8-depth subtree). We could reduce storage by:
- Storing only a subset of nodes and recomputing the rest on demand
- Skipping trivial (single-leaf) subtrees entirely
This trades CPU cycles for reduced storage and I/O bandwidth.
Derived from 0xMiden/crypto#518.
贡献指南
调研方向
Look at the `LargeSmt` and `Subtree` implementations, likely in a crypto or storage module. Understand how nodes are currently stored. The goal is to modify storage to keep a subset and recompute others, possibly skipping trivial subtrees. Check for existing tests on `LargeSmt` to verify correctness after changes.
由索引模型根据 Issue 内容生成。
评估
- 技术栈
- rust
- 领域
- cryptography, performance
- Issue 类型
- 重构
- 难度
- 4/5
- 预计耗时
- 3-5 天
- 活跃度
- 停滞
- 描述清晰度
- 基本清楚
- 新手友好度
- 45/100