 Hi, everyone. I'm Tien-Chan Xie for UC Berkeley, and I'm going to present our new work, Oriole, The Orange Poof with linear proof of time, and this is joint work with Yip-Hong Zong and Dan Zong. First, let me introduce the definition of the AKP. As the orange poof is made by the poof word to convey the verifier, the sound statement is true. And such the orange poof has three properties, company needs, soundness, and zero knowledge. The company needs enables the only honest poof word to pass verification with probability one. The soundness enables honest verifier to detect malicious poof words except for negligible probability. And zero knowledge enables the means that the poof does not make any information about the poof word's secret. Before we go into our work, let me introduce some background information. So here is at least of early stage DKPs. This sort of general proofs require a trusted set up, and their speed is not so good. Several years later, there is a second generation of general proof. They removed the trusted set up, so the security is much, much higher than the previous one. And they also improve the speed, but the proof size is much larger than the previous one. So, second generation general proof has crossing linear proof generation time. And in our new work, we further reduce the proof generation time from crossing linear to linear time. At the same time, we keep the security, so we don't have trusted set up. And we keep roughly the same proof size with second generation. So, in our work, we are purely improving the speed without sacrificing other parameters. Here is our technical contribution. And our linear proof work comes from a new expander sampling algorithm. This expander sampling algorithm enables to sample expander with a cryptographic network's accessible property. And such expander enables us to construct a linear time encoded by linear code, which ultimately leads to a linear time proof work. And second contribution is non-black box proof composition. And this enables us to further reduce the verification cost from square root to log n. And that's all about this short intro. I'm Tian Cheng Xie, and here is our paper link and the code link. I'm looking forward to meet you as cryptos.