Clap: a Semantic-Preserving Optimizing eDSL for Plonkish Proof Systems

• URL: http://arxiv.org/abs/2405.12115v2
• Date: Thu, 11 Jul 2024 16:21:25 GMT
• Title: Clap: a Semantic-Preserving Optimizing eDSL for Plonkish Proof Systems
• Authors: Marco Stronati, Denis Firsov, Antonio Locascio, Benjamin Livshits,
• Abstract summary: Plonkish is a popular circuit format for developing zero-knowledge proof systems. We present Clap, the first Rust e agnostic with a proof system circuit format. Clap casts the problem of producing Plonkish systems and their witness generators as a semantic-preserving compilation problem.
• Score: 7.469723382577489
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Plonkish is a popular circuit format for developing zero-knowledge proof systems that powers a number of major projects in the blockchain space, responsible for holding billions of dollars and processing millions of transactions per day. These projects, including zero-knowledge rollups, rely on highly hand-optimized circuits whose correctness comes at the cost of time-consuming testing and auditing. In this paper, we present Clap, the first Rust eDSL with a proof system agnostic circuit format, facilitating extensibility, automatic optimizations, and formal assurances for the resultant constraint system. Clap casts the problem of producing Plonkish constraint systems and their witness generators as a semantic-preserving compilation problem. Soundness and completeness of the transformation guarantees the absence of subtle bugs caused by under- or over-constraining. Our experimental evaluation shows that its automatic optimizations achieve better performance compared to manual circuit optimization. The optimizer can also be used to automatically derive custom gates from circuit descriptions.

Related papers

• Inverse-Transpilation: Reverse-Engineering Quantum Compiler Optimization Passes from Circuit Snapshots [2.348041867134616]
  We propose a simple ML-based framework to infer underlying optimization techniques by leveraging structural differences observed between original and compiled circuits. Our evaluation shows that a neural network performs the best in detecting optimization passes, with individual pass F1-scores reaching as high as 0.96.
  arXiv  Detail & Related papers  (2025-04-27T05:25:12Z)
• Gumbel Reranking: Differentiable End-to-End Reranker Optimization [61.16471123356738]
  RAG systems rely on rerankers to identify relevant documents. fine-tuning these models remains challenging due to the scarcity of annotated query-document pairs. We propose Gumbel Reranking, an end-to-end training framework for rerankers aimed at minimizing the training-inference gap.
  arXiv  Detail & Related papers  (2025-02-16T13:23:39Z)
• A General Framework for Gradient-Based Optimization of Superconducting Quantum Circuits using Qubit Discovery as a Case Study [0.19528996680336308]
  We present a comprehensive framework for the gradient-based optimization of superconducting quantum circuits. We apply this framework to the qubit discovery problem, demonstrating its effectiveness in identifying qubit designs with superior performance metrics.
  arXiv  Detail & Related papers  (2024-08-22T19:46:50Z)
• Finding Transformer Circuits with Edge Pruning [71.12127707678961]
  We propose Edge Pruning as an effective and scalable solution to automated circuit discovery. Our method finds circuits in GPT-2 that use less than half the number of edges compared to circuits found by previous methods. Thanks to its efficiency, we scale Edge Pruning to CodeLlama-13B, a model over 100x the scale that prior methods operate on.
  arXiv  Detail & Related papers  (2024-06-24T16:40:54Z)
• Analyzing and Enhancing the Backward-Pass Convergence of Unrolled Optimization [50.38518771642365]
  The integration of constrained optimization models as components in deep networks has led to promising advances on many specialized learning tasks. A central challenge in this setting is backpropagation through the solution of an optimization problem, which often lacks a closed form. This paper provides theoretical insights into the backward pass of unrolled optimization, showing that it is equivalent to the solution of a linear system by a particular iterative method. A system called Folded Optimization is proposed to construct more efficient backpropagation rules from unrolled solver implementations.
  arXiv  Detail & Related papers  (2023-12-28T23:15:18Z)
• Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
  We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
  arXiv  Detail & Related papers  (2023-12-21T17:40:18Z)
• Design and execution of quantum circuits using tens of superconducting qubits and thousands of gates for dense Ising optimization problems [12.220619768140903]
  We develop a hardware-efficient ansatz for variational optimization, derived from existing ansatze in the literature, that parametrizes subsets of all interactions in the Cost Hamiltonian in each layer. We report performance significantly better than using a random guess oracle for circuits involving up to approx 5000 two-qubit and approx 5000 one-qubit native gates.
  arXiv  Detail & Related papers  (2023-08-18T02:36:38Z)
• Faster-than-Clifford Simulations of Entanglement Purification Circuits and Their Full-stack Optimization [0.0]
  We develop a simulation algorithm for distillation circuits with gate-simulation complexity of $mathcalO(1)$ steps. It enabled us to use a simple discrete optimization algorithm to design purification circuits from $n$ raw Bell pairs to $k$ purified pairs. The resulting purification circuits are the best-known purification circuits for finite-size noisy hardware.
  arXiv  Detail & Related papers  (2023-07-12T18:00:00Z)
• Adaptive Planning Search Algorithm for Analog Circuit Verification [53.97809573610992]
  We propose a machine learning (ML) approach, which uses less simulations. We show that the proposed approach is able to provide OCCs closer to the specifications for all circuits.
  arXiv  Detail & Related papers  (2023-06-23T12:57:46Z)
• Performance Embeddings: A Similarity-based Approach to Automatic Performance Optimization [71.69092462147292]
  Performance embeddings enable knowledge transfer of performance tuning between applications. We demonstrate this transfer tuning approach on case studies in deep neural networks, dense and sparse linear algebra compositions, and numerical weather prediction stencils.
  arXiv  Detail & Related papers  (2023-03-14T15:51:35Z)
• Post-selection-free preparation of high-quality physical qubits [0.0]
  We present a family of quantum circuits that prepare high-quality |0> states without post-selection. We find meaningful performance enhancements when two-qubit gate fidelities errors go below 0.2%.
  arXiv  Detail & Related papers  (2022-09-12T16:42:33Z)
• Finite-time System Identification and Adaptive Control in Autoregressive Exogenous Systems [79.67879934935661]
  We study the problem of system identification and adaptive control of unknown ARX systems. We provide finite-time learning guarantees for the ARX systems under both open-loop and closed-loop data collection.
  arXiv  Detail & Related papers  (2021-08-26T18:00:00Z)
• QubiC: An open source FPGA-based control and measurement system for superconducting quantum information processors [5.310385728746101]
  We design a modular FPGA based system called QubiC to control and measure a superconducting quantum processing unit. A prototype hardware module is assembled from several commercial off-the-shelf evaluation boards and in-house developed circuit boards. System functionality and performance are demonstrated by performing qubit chip characterization, gate optimization, and randomized benchmarking sequences.
  arXiv  Detail & Related papers  (2020-12-31T21:06:28Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.