 Hi, I'm Russell so Julio Malavota and I would like to show you how to win an argument in one sentence Oh, no, sorry So we will show you a new snark in a set of resetting also known as stock from some hidden order groups so oops yeah, so I'm sure I don't need to remind you how Snark does there was snark does but let me show you anyway via some cartoons So here's our scenario we have Mr. Poofer the penguin and Dauphold verifier the polar bear so contrary to common belief Penguins come from the South Pole actually and polar bears come from the North Pole So they have should never have met each other right so is if if some system work It better be set up free so now Dauphold verifier has some Difficult question. He says what's the meaning of life? Okay, so Mr. Poofer is smart and but so of course He knows the answer, but he's also cool a cool guy So it doesn't want to say much and so he prepared this for the Verifier it is so precise so it's crazy that the Dauphold verifier can't even compare in the wisdom so so in this work We will construct a fish or sorry a proof with only With size only two group elements long plus a lambda B string where lambda is a Security parameter. Okay, so how do we do this? Now starting point is the CS proof from a Cali Which basically in which the pooper basically commits to a or encode this witness in a PCB string and then Commits to the PCP string via a merkle tree and then open to some random positions which are chosen by random oracle and This approach gives you such a proof size Okay, so in order to reduce this all the way down to a constant we we have two ideas. So the first idea is To replace the merkle tree with vector commitment which allows us to open to individual positions with one good element Then the resulting proof has this proof size So which is not very good because it still has lambda group elements So here comes the second idea. We will generalize the vector commitment into something we call sub vector commitment So what it does is basically to open to a bunch of positions with still just one good element And this allows us to reduce the proof size all the way to just two good elements from plus lambda bits so the construction is actually really quite simple which is simple enough to fit into a slide and Actually, we also get a result in a In a setting with setup in this setting we can Instantiate our construction from just strong RSA, but in the without setup setting We need to rely on adaptive root assumption, which is a rather new assumption in class groups of some Imaginary quadratic order so this assumption in this group is recently used to construct verifiable delay function or time lock puzzles So with this okay, so why is it interesting because I'm blockchain so Okay, but So of course for blockchain that is very important to have a short proof size, which is great because we just have two great elements The verify efficiency is also great. We just need one group explanation plus some Order of lambda quite efficient operations Okay, so with this I would like to conclude the talk and the paper is actually online and Julio here is in the job market. So thank you