TS-Verkle: A TypeScript Native Verkle Library With On-chain Verifier

2026-05-09

AI Summary

Blockchain systems face significant scalability bottlenecks, necessitating more efficient data structures and verification mechanisms. Addressing the lack of practical, smart contract–oriented implementations of Verkle trees, this work presents TS-Verkle, the first native TypeScript library for Verkle trees, alongside a companion Solidity-based on-chain verifier compatible with Ethereum and Web3 backends. Leveraging vector commitments and finite-field arithmetic to generate compact proofs, empirical evaluation demonstrates that an unoptimized Verkle tree incurs higher on-chain gas costs than its Merkle counterpart, underscoring the critical importance of optimization techniques for real-world deployment. This study provides the first end-to-end practical reference for advancing blockchain storage and verification architectures.

Abstract

Blockchain systems face significant scalability challenges due to growing data volumes and increasing transaction demands, necessitating more efficient data structures and verification mechanisms. Verkle trees, a novel data structure combining the efficiency of Merkle trees with the compactness of vector commitments, have gained attention for their potential to optimize blockchain storage and improve scalability. However, their practical implementation, especially at the smart contract level, has remained unexplored. To address these challenges, we present TS-verkle, the first known TypeScript-native implementation of Verkle trees designed for web3 backend compatibility, coupled with a corresponding on-chain verifier written in Solidity. Our work bridges this gap by providing a concrete implementation of Verkle trees and demonstrating their feasibility for on-chain verification. While previous literature suggests Verkle trees should outperform Merkle trees due to their succinct proof size, our empirical evaluation reveals that basic implementations of Verkle trees actually incur higher costs than Merkle trees without advanced optimization techniques. This finding represents a crucial insight for blockchain developers and researchers considering Verkle tree adoption. The paper discusses implementation strategies and performance characteristics while exploring implications for scaling and data availability in decentralized blockchain systems.

Problem

• blockchain scalability
• Verkle trees
• data structures
• on-chain verification
• smart contracts

Innovation

• Verkle trees
• TypeScript-native implementation
• on-chain verifier
• blockchain scalability
• empirical evaluation