~/talk

Tabby: A Synthesis-Aided Compiler for High-Performance Zero-Knowledge Proof Circuits

on YouTube 15m
Talkat OOPSLA 2025 · 2025-10-16..10-18· [security, compilers-and-language-design]

speakers

name:Junrui Liu
links:none on file
name:Jiaxin Song
links:none on file
name:Yanning Chen
links:none on file
name:Hanzhi Liu
links:none on file
name:Hongbo Wen
links:none on file
name:Luke Pearson
links:none on file
name:Yanju Chen
links:none on file
name:Yu Feng
links:none on file

resources

video:https://youtu.be/kF4dmYRbg70
slides:none on file

summary

Tabby is a compiler that converts high-level ZK programs into optimized arithmetic circuits by lowering to a domain-specific IR, decomposing the dataflow into independent subproblems, and applying sketch-based program synthesis to generate compact low-level implementations. Equivalence is checked with SMT-based verification, codegen targets multiple proof backends, and artifacts are available. Evaluation on real ZKP apps shows ~70–80% reductions in proving time and circuit size versus mainstream compilers while keeping compilation time comparable.

AI-written summary · about

chapters (9)

  1. 0:00Introduction
  2. 1:08Zero-knowledge proofs
  3. 3:33Efficient ZK circuit challenges
  4. 5:00Motivating ZK optimization
  5. 8:55Invariant synthesis with program analysis
  6. 11:20Tabby’s compiler pipeline
  7. 12:24Evaluation vs mainstream compilers
  8. 14:32Ablation study and takeaways
  9. 14:55Summary and open-source

related talks

~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.