---
title: O(1) Labs feedback
tags: rfcc, themis
---

Iteration 2: https://hackmd.io/@izzy/rJApOn5zu

### Questions

- Could you elaborate why the scheme relies on Lagrange polynomials -- I believe this is due to how PLONK encodes the program and its constraints?
- Could you briefly explain our add references explaining why the scheme does not require a trusted setup?
- Is there any mechanism to prevent spending of the BBA update request and the proof of reward?
- In the BBA update proof system, you say "Verifier efficiency. Somewhere in the neighborhood of 1ms per proof, plus 10ms per batch." Does that mean you are considering batching BBA update proofs? If so, would those proof happen at a user-level (i.e multiple update from the same user) or at the service-level (i.e. batching multiple update proofs from multiple users)?
- Is there any open source documentation of the Pickles SNARK library?
- Do you have a ballpark of how cheaper would be the batch proof verification in Mina compared to the numbers for Ethereum? (roughly)
- We've implemented a [POC of the pairing-friendly BBA](https://github.com/brave-experiments/sps-eq/blob/main/examples/bba_verification_example.rs). Is there any place where we could check an example of a Snapp similar to needed for THEMIS?
- What would the "road to production" look like? I.e. which libraries/frameworks would you recommend to develop the proof verifier, circuits, smart contracts? Are they available already? Are there any required components that are not live yet?