MHOT achieves provably minimal tree height via discriminative-bit indexing and hierarchical proofs, delivering up to 9X write throughput, 4X lower amplification, 2X smaller proofs, and 0% Nurgle attack success versus MPT on Ethereum workloads.
Kvac: Key-value commitments for blockchains and beyond
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
MHOT: Height-Optimized Authenticated Data Structure for Blockchain State Commitment
MHOT achieves provably minimal tree height via discriminative-bit indexing and hierarchical proofs, delivering up to 9X write throughput, 4X lower amplification, 2X smaller proofs, and 0% Nurgle attack success versus MPT on Ethereum workloads.