 All right, there we go. So, RLand has been mentioned quite a few times throughout presentations this week, and I wanted to kind of talk about how it worked, like what's under the hood in a way that's accessible to most people. So, the key part is the rate limiting. So, it's basically controlling how fast you can interact with the system. So, an example would be interacting with Discord. If you're in a big Discord, there's a slowdown mode where you can only send one message every like 15 seconds or so, it's very similar. So, it is made up of a couple things. So, semaphore, which is the talk before this, which is basically just proving you're part of an anonymity set without revealing who you are. Shamir's secret sharing scheme, which is the majority of this talk, and some time or event delineation, which I'll get into in a minute. There's kind of three stages to how RLand works. So, there's a registration process, so like joining, which is basically just a Markle Tree. And signaling, which is your actual sending of messages, then there is the slashing or secret recovery. So, yeah, so like I just said, the registration process is just the Markle Tree. So, this is basically what semaphore is. So, it's just proving you're part of an anonymity set. And this can be done on or off chain. So, the signaling part, this is kind of the meat of all of this is, so it's a circum circuit. And the first public input is the epoch, which is like a time or it could be like a post on Reddit or something like that. Just some delineation in a time or an event. And then the actual message, and then a secret key. And out of that comes proof that your epoch and your message are accurate and verified with what you put into it. It proves that you belong to that Markle Tree, that membership group. And it spits out a secret chair. So, this secret chair is one of the most important parts of how RLand works. Basically, if you have a secret, you can plot that on a graph and on the y-axis. You can, you know, this is basically how Schumer secret sharing works. The random, so you have to have a random point to construct your shares. And that is derived from the epoch. And these shares are generated from the message hash. So, the shares, basically the whole idea behind Schumer secret sharing scheme is you have, you have a secret, you break it up into parts and you distribute those parts publicly. And if you have enough of them, you can reconstruct the secret. So, with these two shares, you can reconstruct where that line is. So I'm gonna go through how that works. So if you have one share, you really don't know where that line is, right? If you have two shares, then you can see where it crosses the y-axis and you can determine what the secret is. So if someone basically submits too many messages too fast like, you know, within a 15 second time period or whatever your rate limiting is, then someone can reconstruct your secret, your private key, basically figure out your identity commitment and withdraw a stake or something like that. And this can be split up into multiple pieces. It doesn't just have to be a linear function. This could be a polynomial. So you can have multiple shares that you need to be able to recover. So you can say a person can send 15 messages per day, but that's it. So this is the actual circuit. I know this looks a little confusing, but if you kind of just look and see how all this is assembled, it's really not that bad. So you have the epoch, the message, and the secret key going in. And the center part here, I have a little laser pointer, this center part is the Schumer secret sharing scheme. And the right side, this is basically just the construction of the identity commitment. So it's your public identifier for being anonymous. And the left side, so this is just the nullifier. So it's basically the equivalent of a nonce. And some use cases for this that we thought of is you could do auctions where you can have only so many bids per item or whatever bids per user. You can have a bulletin board system like Reddit where you can only comment once per post or once per level of post. We've also thought about using this for preventing denial of service attacks for something like Cloudflare, where we can do that anonymously and decentralized. And then, so this is also used in a couple of applications that the PSE has developed, like Skidder. So we have ZK chat in there. So it's anonymous chat where it's rate limited. And so we have a JavaScript library for this. We're working on a Rust library in collaboration with the VAC team. And we're probably gonna write a Python version and a couple other bindings for languages. Yeah, so if you wanna look at the documentation or the code, there's the QR code. And if you have any questions, you can join our Discord. Again, I'm at Heart Engineer. And yeah, thank you. Thank you so much. We have still one minute and a half. Maybe one question. The audience, some Q&A. Any questions? Raise your hand here. Hello. How does this compare to, suppose if you use the ZXs approach where you keep one notes and you keep countering the notes and you keep including a counter and you improve that counter's lesson, some number. I don't know. I'll have to talk to you about that offline. I'll have to think about that for a minute. All right, thanks. Okay. Okay. Any other questions? All right. Thank you. Thank you.