It's very difficult how to do it per second, right? Because all of this requires some like computations. You cannot even do it every second. So you have to take this into account because if you are building zero knowledge proof systems for this stuff, we also need to account for how, I mean, the frequency of this. It might take time and you know better, with all of the guests that you have that some proving systems are not super fast. Or even if it's not super fast, even if we say a minute, we cannot go less than a minute. How would you do that? The audit should happen in a timestamp defined by some set of auditors in
This week, Anna explores the topic of proof of solvency with Kostas Chalkias, co-founder and chief of Cryptography at MystenLabs. They cover Kostas’ background in Cryptography and explore his work on Proof of Reserves, otherwise known as Proof of Solvency. They review past Proof of Solvency models using ZKPs and look at the protocols that major centralized exchanges are currently using. Then they dive into the security vulnerabilities, privacy issues, and general bugs that Kostas and his collaborators have identified in these protocols and their recommendations on how to better build Proof of Solvency systems.
Here are some additional links for this episode:
Today’s episode is sponsored by Aleo
Aleo is a new Layer-1 blockchain that achieves the programmability of Ethereum, the privacy of Zcash, and the scalability of a rollup.
If you’re interested in building private applications then check out Aleo’s programming language called Leo. Visit leo-lang.org to start building.
You can also join Aleo’s incentivized testnet3 by downloading and running a snarkOS node. No sign-up is necessary to participate. For questions, join their Discord at aleo.org/discord.
If you like what we do: