Modern blockchain state management faces a critical scalability bottleneck: maintaining cryptographic commitments over hundreds of millions of entries becomes computationally prohibitive. Ethereum's transition to Verkle Trees: polynomial commitment accumulators reducing proof sizes from O(width * depth) to O(depth) via constant-size IPA vector commitments, is a critical step toward stateless operation. Yet, current implementations exhibit pathological characteristics that burden home validators. We identify four inefficiencies in the reference go-verkle implementation \cite{kaur2025goverkle, kaur2025goethereum}: (1) phantom node creation during non-existent account deletion; (2) 64-byte database keys triggering excessive LSM-tree compaction; (3) redundant memory copying in proof deserialization; (4) a Proof of Absence wire format incompatibility causing non-deterministic serialization. We present Fractional Verkle Trees (FVT), a hypertree decomposition partitioning global state into N independent sub-accumulators coordinated by a Merkle commitment tree, achieving improved cache locality, zero-lock-contention goroutine-parallel commitment computation, and faster root recomputation (91 $μ$s vs $\sim$500 ms). We address each inefficiency via existence checks, 32-byte SHA256 node references, zero-copy reference-counted buffers, and HashMap-based lexicographic deduplication. Benchmarks on Apple M1 Pro show 57\% heap allocation reduction (566,760 to 242,004 bytes per 10K proofs), parallel insertion at 2,433 ns/op, and network-wide elimination of 4.85 PB/year across 6,000 full nodes, advancing the Ethereum stateless roadmap.

翻译：现代区块链状态管理面临关键的可扩展性瓶颈：对数亿条条目维持密码学承诺的计算开销已变得不可负担。以太坊向Verkl树（多项式承诺累加器，通过恒定大小的IPA向量承诺将证明规模从O(宽度×深度)降至O(深度））的过渡，是实现无状态运行的关键一步。然而，当前实现存在加重家庭验证器负担的病态特性。我们识别出参考实现go-verkle\cite{kaur2025goverkle, kaur2025goethereum}中的四项低效问题：(1) 对不存在账户执行删除操作时产生幽灵节点；(2) 64字节数据库键触发过度LSM树压缩；(3) 证明反序列化中的冗余内存拷贝；(4) 不存在的证明协议格式不兼容导致非确定性序列化。我们提出分数维树（FVT），一种基于超树分解的架构，将全局状态划分为N个由Merkle承诺树协调的独立子累加器，实现更优的缓存局部性、零锁竞争的Go协程并行承诺计算，以及更快的根重新计算（91微秒对比约500毫秒）。我们通过存在性检查、32字节SHA256节点引用、零拷贝引用计数缓冲区以及基于哈希表的字典序去重来解决上述低效问题。在Apple M1 Pro上的基准测试显示，堆内存分配减少57%（每万次证明从566,760字节降至242,004字节），并行插入操作耗时2,433纳秒/次，全网6,000个全节点每年消除4.85 PB数据冗余，推动以太坊无状态路线图的发展。