Abstract. This paper presents an experimental evaluation of the efficiency of the proposed digital signature based on a Verkle tree using the Chinese Remainder Theorem. A software implementation of the algorithms for key generation, signature formation, and verification has been developed. In the proposed scheme, the Verkle tree is used for compact representation of commitments, while the Chinese Remainder Theorem is applied to optimize modular computations and improve the computational efficiency of signing and verification operations. An analysis of the time characteristics of the algorithms was carried out, and complexity indicators were obtained. Experimental results were obtained on a fixed computing platform with multiple test runs to ensure statistical reliability. A comparative analysis was performed with a digital signature based on the classical polynomial commitment scheme Kate–Zaverucha–Goldberg (KZG) in terms of the main signature parameters and execution time. The obtained results demonstrate the potential of using the Verkle tree in combination with the Chinese Remainder Theorem for constructing compact and computationally efficient digital signatures.

Keywords: Verkle tree, vector commitment, polynomial commitment, Chinese Remainder Theorem, digital signature, authentication, verification.