Table of Contents
Fetching ...

Bionetta: Efficient Client-Side Zero-Knowledge Machine Learning Proving

Dmytro Zakharov, Oleksandr Kurbatov, Artem Sdobnov, Lev Soukhanov, Yevhenii Sekhin, Vitalii Volovyk, Mykhailo Velykodnyi, Mark Cherepovskyi, Kyrylo Baibula, Lasha Antadze, Pavlo Kravchenko, Volodymyr Dubinin, Yaroslav Panasenko

TL;DR

Bionetta addresses client-side zero-knowledge proving for neural networks by integrating an R1CS-based Groth16 framework with UltraGroth lookup tables and circuit-embedded weights, enabling succinct proofs and efficient on-chain verification ($|\pi|$ constant and four pairings). It combines float quantization with a ReLU-based activation strategy and a quantization/overflow management scheme to map real-valued inference to finite-field arithmetic, while preserving accuracy within tight bounds. The key contributions are (i) circuit-embedded weights that drastically reduce witness size, (ii) a quantization/overflow framework with provable error bounds, (iii) UltraGroth enabling lookup-based non-linear-cost reduction, and (iv) extensive experiments showing substantial improvements over state-of-the-art zkML frameworks, including mobile-device proving. The practical impact is enabling deployable, privacy-preserving ML proofs on Ethereum-compatible runtimes and edge devices, with an emphasis on client-side proving and compact verification, though the approach remains non-universal due to public-weights constraints.

Abstract

In this report, we compare the performance of our UltraGroth-based zero-knowledge machine learning framework Bionetta to other tools of similar purpose such as EZKL, Lagrange's deep-prove, or zkml. The results show a significant boost in the proving time for custom-crafted neural networks: they can be proven even on mobile devices, enabling numerous client-side proving applications. While our scheme increases the cost of one-time preprocessing steps, such as circuit compilation and generating trusted setup, our approach is, to the best of our knowledge, the only one that is deployable on the native EVM smart contracts without overwhelming proof size and verification overheads.

Bionetta: Efficient Client-Side Zero-Knowledge Machine Learning Proving

TL;DR

Bionetta addresses client-side zero-knowledge proving for neural networks by integrating an R1CS-based Groth16 framework with UltraGroth lookup tables and circuit-embedded weights, enabling succinct proofs and efficient on-chain verification ( constant and four pairings). It combines float quantization with a ReLU-based activation strategy and a quantization/overflow management scheme to map real-valued inference to finite-field arithmetic, while preserving accuracy within tight bounds. The key contributions are (i) circuit-embedded weights that drastically reduce witness size, (ii) a quantization/overflow framework with provable error bounds, (iii) UltraGroth enabling lookup-based non-linear-cost reduction, and (iv) extensive experiments showing substantial improvements over state-of-the-art zkML frameworks, including mobile-device proving. The practical impact is enabling deployable, privacy-preserving ML proofs on Ethereum-compatible runtimes and edge devices, with an emphasis on client-side proving and compact verification, though the approach remains non-universal due to public-weights constraints.

Abstract

In this report, we compare the performance of our UltraGroth-based zero-knowledge machine learning framework Bionetta to other tools of similar purpose such as EZKL, Lagrange's deep-prove, or zkml. The results show a significant boost in the proving time for custom-crafted neural networks: they can be proven even on mobile devices, enabling numerous client-side proving applications. While our scheme increases the cost of one-time preprocessing steps, such as circuit compilation and generating trusted setup, our approach is, to the best of our knowledge, the only one that is deployable on the native EVM smart contracts without overwhelming proof size and verification overheads.

Paper Structure

This paper contains 30 sections, 16 theorems, 59 equations, 9 figures, 6 tables, 1 algorithm.

Key Result

Proposition 1

The main advantage of the R1CS arithmetization is that any addition or multiplication by constants can be done completely for free! Indeed, consider the previous example. Since it contains an addition gate, we can simplify R1CS down to three constraints:

Figures (9)

  • Figure 1: Relative resources overhead of existing zkML frameworks compared to Bionetta (UltraGroth). Lower values are better.
  • Figure 2: Architecture of the Bionetta framework
  • Figure 3: The precision cut operation in the Bionetta system. The dashed magenta boxes represent the layers of the neural network. The dashed blue box represents the output of the layer $i$, which is cut by $\ell_i\rho$ bits. Finally, green arrows represent the pre- and post-processing of the data done outside the circuit.
  • Figure 4: The witness includes three parts: the public part $\mathcal{I}_X$, the private part $\mathcal{I}_W$ split into $d+1$ rounds $\{\textcolor{blue!50!black}{\mathcal{I}_W^{\langle i \rangle}}\}_{i \in [d+1]}$ and the sampled challenges $\{\mathcal{I}_R^{\langle i \rangle}\}_{i \in [d]}$.
  • Figure 5: The prover complexity depending on the chunk size $w$. The different colors represent different values of $L$.
  • ...and 4 more figures

Theorems & Definitions (25)

  • Example
  • Example
  • Proposition
  • Definition
  • Proposition
  • Definition
  • Example
  • Theorem
  • Example
  • Proposition
  • ...and 15 more