Theoretical implementation and testing of the first stage of the ZK-STARK protocol “Arithmetisation”

Authors

DOI:

https://doi.org/10.26565/2304-6201-2024-63-01

Keywords:

protocol, ZK-STARK, ARETHMETIZATION, modeling, program, implementation, C programming language, testing, blockchain, efficiency

Abstract

Relevance:  Starting with the invention of the Internet, the world began to change rapidly, and the pace of change is increasing, so the problem of data storage and processing is becoming more and more relevant. The ZK-STARK protocol is a new cryptographic zero-knowledge proof protocol that is not yet widely used in practice and allows you to check a message or a transaction on the blockchain network for authenticity without reproducing it completely. At the moment, gaps and problems related to this protocol are identified: computational complexity, possible poor compatibility with other protocols, and resistance to attacks from quantum computers. Therefore, the paper aims to supplement the coverage of the problem associated with computational complexity and to propose solutions to this problem.

Purpose: on the basis of the theoretical implementation of the first stage named Arithmetization of the ZK-STARK protocol, to test its software implementation in order to provide recommendations on its most computationally efficient version.

Research methods: mathematical statements on interpolation theory, group theory, number theory; information on Fibonacci numbers; information on the Euler function; generating element of a group; cyclic groups; Lagrange interpolation polynomial and the sequence of calculations of Arithmetization; Visual Studio 2022 programming environment, C++ programming language, NTL library, Microsoft Excel.

Results of work: The result of the work is the theoretical implementation of the first stage of the ZK-STARK protocol and the effectiveness testing of the first stage, and providing recommendations for its most effective version. 

Conclusion: Testing has shown that the practical implementation of the Arithmetization based on the inverse fast Fourier transform has a time complexity , that is in  times less than the time complexity of the Arithmetization based on  inverse matrices method and Gaussian method for interpolation, that speeds up the work of Arithmetization of  the ZK-STARK protocol. 

Author Biographies

  • Oleh Averkov, Karazin Kharkiv National University, Svobody Sq 4, Kharkiv, Ukraine,61022

    Master’s student, Department of Security information Systems and Technologies, Faculty of Computer Science

  • Oleksandr Kuznetsov , V. N. Karazin Kharkiv National University, Svobody Sq 4, Kharkiv Ukraine, 61022

    Doctor of technical science; Professor of Department of Security of Information Systems and Technologies, Faculty of Computer Science

  • Iryna Lysytska, V. N. Karazin Kharkiv National University, Svobody Sq 4, Kharkiv Ukraine, 61022

    Doctor of technical science; Professor of  Department of Security of Information Systems and Technologies, Faculty of Computer Science

References

CONSENSYS, "Zero-Knowledge Proofs: STARKs vs SNARKs," BLOCKCHAIN EXPLAINED, [Online]. Available: https://consensys.net/blog/blockchain-explained/zero-knowledge-proofs-starks-vs-snarks/. [Accessed: 30-Apr-2023].

Bit2Me ACADEMY, "What are zk-STARKs?," [Online]. Available: https://academy.bit2me.com/en/what-are-zk-stark/. [Accessed: 30-Apr-2023].

Chainlink, "Understanding the Difference Between zk-SNARKs and zk-STARKS," [Online]. Available: https://chain.link/education-hub/zk-snarks-vs-zk-starks. [Accessed: 25-Apr-2024].

Ramses F., "STARKs vs SNARKs," Medium, [Online]. Available: https://medium.com/@ramsesfv/starks-vs-snarks-d2e09c4e6069. [Accessed: 25-Apr-2024].

"Throne of ZK: SNARK vs STARK," Medium, [Online]. Available: https://medium.com/nonce-classic/throne-of-zk-snark-vs-stark-e449984d5c36. [Accessed: 25-Apr-2024].

Techopedia, "Zero-Knowledge STARK (zkSTARK)," [Online]. Available: https://www.techopedia.com/definition/zero-knowledge-stark-zkstark. [Accessed: 25-Apr-2024].

Changelly Blog, "New Technology Explained: Zero-Knowledge Proof – Security Enhancing Protocol," [Online]. Available: https://changelly.com/blog/zero-knowledge-proof-explained/. [Accessed: 25-Apr-2024].

Hacken, "Comparing ZK-SNARKs & ZK-STARKs: Key Distinctions In Blockchain Privacy Protocols," [Online]. Available: https://hacken.io/discover/zk-snark-vs-zk-stark/. [Accessed: 25-Apr-2024].

Binance Academy, "zk-SNARKs and zk-STARKs Explained," [Online]. Available: https://academy.binance.com/en/articles/zk-snarks-and-zk-starks-explained. [Accessed: 30-Apr-2023].

Binance Academy, "zk-STARKs," [Online]. Available: https://academy.binance.com/en/glossary/zk-starks. [Accessed: 25-Apr-2024].

StarkWare, "Arithmetization I," Medium, [Online]. Available: https://medium.com/starkware/arithmetization-i-15c046390862. [Accessed: 25-Apr-2024].

Polygon Labs, "Introducing Plonky2," Polygon, [Online]. Available: https://polygon.technology/blog/introducing-plonky2. [Accessed: 25-Apr-2024].

StarkWare Team, "ethSTARK Documentation Version 1.1," IACR, [Online]. Available: https://eprint.iacr.org/2021/582.pdf. [Accessed: 25-Apr-2024].

H. P. William, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery, Numerical Recipes in C++. The Art of Scientific Computing, 2nd ed: Cambridge University Press, Cambridge, 2003, 1004 с.

Державний університет "Житомирська політехніка", "Освітній портал," [Online]. Available: https://learn.ztu.edu.ua. [Accessed: 25-Apr-2024].

Р. М. Літнарович, Алгебра матриць: Курс лекцій, Рівне, Україна: МЕГУ, 2007, 112 с. [Online]. Available: https://core.ac.uk/download/pdf/14034615.pdf. [Accessed: 25-Apr-2024].

О. О. Кузнецов, "Конспект лекцій по математичним основам криптографічних доказів з нульовим розголошенням. Лекція №22: Дискретне перетворення Фур'є," PROXIMA LABS, 1501 Larkin Street, Suite 300, San Francisco, USA, 13 с.

"The Fast Fourier Transform (FFT): Most Ingenious Algorithm Ever?," Youtube, [Online]. Available: https://www.youtube.com/watch?v=h7apO7q16V0. [Accessed: 25-Apr-2024].

О. О. Кузнецов, "Конспект лекцій по математичним основам криптографічних доказів з нульовим розголошенням. Лекція №23: Дискретне перетворення Фур'є в кінцевих полях," PROXIMA LABS, 1501 Larkin Street, Suite 300, San Francisco, USA, 13 с.

Downloads

Published

2024-11-25

Issue

Section

Статті

How to Cite

Theoretical implementation and testing of the first stage of the ZK-STARK protocol “Arithmetisation”. (2024). Bulletin of V.N. Karazin Kharkiv National University, Series «Mathematical Modeling. Information Technology. Automated Control Systems», 63, 6-16. https://doi.org/10.26565/2304-6201-2024-63-01