 All right. Hello, everyone. Yeah, as mentioned, my name is Kelly Olson and I'm here representing the VDF Alliance and The whole goal of the VDF Alliance is to bring verifiable delay functions into production So just to talk very briefly about the VDF Alliance. It's a collaboration between some blockchain foundations such as the Ethereum Foundation some corporate sponsors like AWS and Xilinx and then also some academic institutions like Sabanchi So also maybe briefly for those that don't know last year There was a talk given by Dan Bonnet on a paper by Benedict Boons and Ben Fish who are here about Verifiable delay functions verifiable delay functions is basically a function that requires this number of sequential steps And once that's completed you can provide a very short proof that you've completed those steps But in order to make these things actually useful for production You need to ensure that the verifiable delay function is both efficient and fast and also secure And so we've made a lot of progress in the past year since this was was first introduced And we're asking the crypto community here to help us make it even faster and even more secure And these verifiable delay functions have a ton of use in blockchain and distributed settings for things like randomness beacons proof of space time proof of replication and we really think there's a great opportunity to really bring these into production after after a recent introduction So what we're asking is is on the first thing is to go to vdfalliance.org and sign up to participate in a hundred or hopefully a Thousand person MPC ceremony the goal of this MPC ceremony is to generate an un-factorizable modulus and fortunately Mootoo our chair of the conference this year and also Kermit have been developing an MPC ceremony to accomplish Just this so sometime in the beginning of next year We're hoping to have sort of a wide-scale distributed MPC ceremony Maybe the largest ever to actually generate this public good that anyone can use So that's the first thing that that we'd like to ask your help for Vdfalliance.org is where you can sign up And then the second thing is that we're trying to make these things even faster So already we have an FPGA implementation of one of these VDF constructions and We actually use this to Solve a 20 year old puzzle by Ron revest at MIT So if you look up the LCS 35 time lock puzzle We were able to solve this puzzle that was supposed to take 35 years in just two months using our FPGA implementation And so if you have any experience with hardware multiplication Montgomery multiplication Karatsuba Chinese remainder theorem any experience both on the algorithmic side or on the hardware implementation side right now We're running a competition in collaboration with AWS There's a hundred thousand dollars in prizes The first round of that competition will end at the end of September And then the next round will end at the end of the year So would really appreciate it if the community joins in and would would love to take you know a crypto 18 Paper into production in the next year. Thank you