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

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

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 significa...

Full description

Saved in:
Bibliographic Details
Published in:Cryptography Vol. 7; no. 1; p. 14
Main Authors: Bespalov, Yuri, Kovalchuk, Lyudmila, Nelasa, Hanna, Oliynykov, Roman, Viglione, Rob
Format: Journal Article
Language:English
Published: Basel MDPI AG 01-03-2023
Subjects:
Algorithms
Analysis
binary tree
Blockchain
Cryptography
Decentralization (Management)
Efficiency
Methods
Parameters
perfect tree
Pricing policies
Protocol
Publishing
Scalability
sidechain
Simulation models
succinct blockchain
Trees
zk-SNARK
Ukraine
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2410-387X
2410-387X
DOI:10.3390/cryptography7010014