Pattern matching algorithms in blockchain for network fees reduction

• Published in: The Journal of supercomputing Vol. 80; no. 12; pp. 17741 - 17759
• Main Authors: Susik, Robert, Nowotniak, Robert
• Format: Journal Article
• Language: English
• Published: New York Springer US 01.08.2024; Springer Nature B.V
• Subjects: Algorithms; Blockchain; Compilers; Computer Science; Costs; Digital currencies; Fees & charges; Interpreters; Pattern matching; Popularity; Processor Architectures; Programming Languages; Smart contracts; Software; Web browsers; Matching; Pattern; String; Blockchain; Ethereum; Fee
• ISSN: 0920-8542; 1573-0484; 1573-0484
• DOI: 10.1007/s11227-024-06115-8

Blockchain received a vast amount of attention in recent years and is still growing. The second generation of blockchain, such as Ethereum, allows execution of almost any program in EVM, making it a global protocol for distributed applications. The code deployment and each operation performed in EVM cost the network fee called gas, whose price varies and can be significant. That is why code optimization and well-chosen algorithms are crucial in programming on the blockchain. This paper evaluates the gas usage of several exact pattern matching algorithms on the EVM. We also propose an efficient implementation of the algorithms in the Solidity/YUL language. We evaluate the gas fees of all the algorithms for different parameters (such as pattern length, alphabet size, and text size). We show a significant gas fee and execution time reduction with up to 22-fold lower gas usage and 55-fold speed-up compared to StringUtils (a popular Solidity string library).