Fractional Verkle Trees decompose global state into N sub-accumulators with a coordinating Merkle tree, yielding faster root recomputation, lower memory use, and parallel insertion in blockchain state accumulators.
Title resolution pending
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
-
Fractional Verkle Trees: A Hypertree Decomposition and Verified Proof Serialization Architecture for High-Performance Blockchain State Accumulators
Fractional Verkle Trees decompose global state into N sub-accumulators with a coordinating Merkle tree, yielding faster root recomputation, lower memory use, and parallel insertion in blockchain state accumulators.