We will be hosting our first AMA featuring the following PSE Projects (https://pse.dev/en/projects). Send in your questions as a reply to this case and the teams will try to answer them on Wednesday Feb 21st.

A list of the projects attending can be found below 👇

Working on building zkTLS infra/products. A ruthless empiricist and meme connoisseur.

http://opacity.network

/// Simple Q to start with from me 👇


# Can one person from each team explain what they work on in two ways, one for each persona below?


## 🥺reasonably intelligent, non-technical normie

## 😎the most giga-chad, galactic big-brain, “doesn’t know the price of milk” cryptographer you know

janitor for /zk and some more stuff here linktr.ee/randomishwalk

Trusted setups:
## 🥺 Some proof schemes need a trusted setup as part of their implementation process, which involves collecting computations from many people. We try to make this process easy.
## 😎 We run a Powers of Tau ceremony for Groth-16 phase 1 in BN-254, and we're developing P0tion for Phase 2 ceremonies.

I'll attempt a definition: A proving scheme is a method for reducing a computation to a small piece of data. Just as a hash can represent a large document, a ZK proof can represent a computation along with its inputs and outputs.

i like that!

how would you simplify the first explanation even more?

for example, what if someone doesn’t know what a proof scheme is?