Models for Generation of Proof Forest in zk-SNARK Based Sidechains

Cryptography

article

Yuri Bespalov¹  Lyudmila Kovalchuk²  Hanna Nelasa⁴  Roman Oliynykov²  Rob Viglione⁶ 

[1] Department of Mathematical Methods in Theoretical Physics, Bogolyubov Institute for Theoretical Physics, National Academy of Sciences of Ukraine;Input Output;G. E. Pukhov Institute for Modelling in Energy Engineering, National Academy of Sciences of Ukraine;Department of Information Security, National University “Zaporizhzhia Polytechnic”;Department of Information Systems and Technologies Security, V. N. Karazin Kharkiv National University;Horizen Labs

关键词: blockchain;    sidechain;    zk-SNARK;    succinct blockchain;    binary tree;    perfect tree;    free magma;    operad;    PRO;    occupancy distribution;   

DOI  :  10.3390/cryptography7010014

学科分类：社会科学、人文和艺术（综合）

来源: mdpi

【 摘 要 】

Sidechains are among the most promising scalability and extended functionality solutions for blockchains. Application of zero knowledge techniques (Latus, Mina) allows for reaching high level security and general throughput, though it brings new challenges on keeping decentralization where significant effort is required for robust computation of zk-proofs. We consider a simultaneous decentralized creation of various zk-proof trees that form proof-trees sequences in sidechains in the model that combines behavior of provers, both deterministic (mutually consistent) or stochastic (independent) and types of proof trees. We define the concept of efficiency of such process, introduce its quantity measure and recommend parameters for tree creation. In deterministic cases, the sequences of published trees are ultimately periodic and ensure the highest possible efficiency (no collisions in proof creation). In stochastic cases, we obtain a universal measure of prover efficiencies given by the explicit formula in one case or calculated by a simulation model in another case. The optimal number of allowed provers’ positions for a step can be set for various sidechain parameters, such as number of provers, number of time steps within one block, etc. Benefits and restrictions for utilization of non-perfect binary proof trees are also explicitly presented.

【 授权许可】

CC BY